IMPROVED SHORTEST PATH ALGORITHMS FOR TRANSPORT NETWORKS

The three most appropriate algorithms for calculating shortest paths in transport road networks--those du to E. F. Moore, D. 'Esopo and E.W. Dijkstra--are examined using CPU times on five realistic networks as criteria. Their relative efficiencies are shown to depend on certain characteristics of the network. A number of suggestions are also made for improved network data structures and for reducing the size of the network prior to calculating shortest paths.

  • Corporate Authors:

    Pergamon Press, Incorporated

    Maxwell House, Fairview Park
    Elmsford, NY  USA  10523
  • Authors:
    • Van Vliet, D
  • Publication Date: 1978-2

Media Info

  • Features: References;
  • Pagination: p. 7-20
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00183948
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Dec 29 1978 12:00AM