Skip to main content
SpringerLink
Log in

Tree-building with complex cost structures — A new algorithm for incorporation into transport demand models

  • Published:
Transportation Aims and scope Submit manuscript

Abstract

This paper highlights some of the difficulties involved in the implementation of complex cost structures in the tree-building section of a transport demand model. The conventional tree-building algorithm is briefly described and is seen to be inadequate for the present purpose. A new algorithm is then presented which is able to implement complex cost structures properly. An example is given of the application of this algorithm to the building of tree in a public transport network. The performance of a computer program incorporating the new alrogrithm is evaluated against alternative methods of implementing complex cost structures. Some mention is then made of the vast range of potential uses for the new algorithm in the field of transport modelling and simulation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bellman, R. E. [1958]. “On a routing problem,” Quart. Appl. Math., 16, 87–90.

    Google Scholar 

  • Bonsall, P. W. [ 1974 ]. “Implementation of various cost functions in tree-building algorithms,” Institute for Transport Studies, Working Paper 47 (unpublished).

  • Bonsall P. W., Cripps, E. L., Goodman, P. R., Hankin, A., Mackett, R. L., Sanderson, L., Senior, M. L., Southworth, F., Spence, R., Williams, H. C. W. L. and Wilson, A. G. [1974]. “A transport model for West Yorkshire,” Institute for Transport Studies, Working Paper 46 (unpublished).

  • Coventry Transportation Study [1972]. Report on Phase Two, Technical Report, Ch 28–68, City of Coventry, December.

  • Dijkstra, E. W. [1959]. “A note on two problems in connection with graphs,” Numer. Math. 1, 269–271.

    Google Scholar 

  • Moore, E. F. [ 1957 ] . “The shortest path through a maze,” International Symposium on the theory of switching, Proceedings, Harvard University, April 22–25.

  • Murchland, J. D. [ 1971 ]. “Shortest distances between all vertices in a network and allied problems, Veroeffentlichungen des Institutes fuer stadtbauwesen Technische Universitact Braunschweig, Heft 7.

  • Potts and Oliver [1972]. “Flows on transportation networks,” Mathematics in Science and Engineering Vol 90, pp. 56–63.

    Google Scholar 

  • Voorhees, A. M. and Associates [ 1973 ]. Tyne-Wear Plan, Technical Report, pp. 96.

Download references

Author information

Authors and Affiliations

  1. Institute for Transport Studies, University of Leeds, Leeds, England

    Peter Bonsall

Authors
  1. Peter Bonsall
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bonsall, P. Tree-building with complex cost structures — A new algorithm for incorporation into transport demand models. Transportation 5, 309–329 (1976). https://doi.org/10.1007/BF00148381

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00148381

Keywords

Search

Navigation