MINIMUM PATH VINE FOR A NETWORK WITH INTRA-NODAL TRAVEL COSTS

This paper gives a description of an algorithm which is suitable for the determination of minimum cost paths in networks where costs may be incurred intra-nodally, i.e. on the transfer from one arc to another arc. A particular type of network with this property is an urban surface street network in which minimum cost paths may depend greatly on the relative difficulties involved in making left or right turns at intersections. The algorithm strategy is outlined and an ALGOL version of it is given. An application of the algorithm to a central business district network is also described. /Author/TRRL/

  • Availability:
  • Corporate Authors:

    GORDON AND BREACH SCIENCE PUB.

    AMSTERDAM:
    ,    

    Gordon & Breach Science Publishers Limited

    41/42 William IV Street
    London,   England 
  • Authors:
    • TAYLOR, MAP
  • Publication Date: 1977

Media Info

  • Features: Figures; References;
  • Pagination: p. 251-256
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00163969
  • Record Type: Publication
  • Source Agency: Transport and Road Research Laboratory (TRRL)
  • Report/Paper Numbers: Analytic
  • Files: ITRD, TRIS
  • Created Date: Dec 8 1977 12:00AM