Shortest Path Algorithms: An Evaluation Using Real Road Networks

References

• Ahuja R. K. , Magnanti T. L. , Orlin J. B. Network Flows: Theory, Algorithms and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Ahuja R. K. , Mehlhorn K. , Orlin J. B. , Tarjan R. E. Faster algorithms for the shortest path problem. JACM (1990) 37 213 223 Crossref, Google Scholar
• Bellman R. E. On a routing problem. Q. Appl. Math. (1958) 16 87 90 Google Scholar
• Cherkassky B. V. , Goldberg A. V. , Radzik T. Shortest paths algorithms: Theory and experimental evaluation. (1993) . Technical report 93-1480, Computer Science Department, Stanford University Google Scholar
• Corman T. H. , Leiserson C. E. , Riverst R. L. Introduction to Algorithms (1990) (MIT Press, Cambridge, MA) Google Scholar
• Dial R. B. Algorithm 360: Shortest path forest with topological ordering. Comm. ACM (1969) 12 632 633 Crossref, Google Scholar
• Dial R. B. , Glover F. , Karney D. , Klingman D. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks (1979) 9 215 248 Crossref, Google Scholar
• Dijkstra E. W. A note on two problems in connection with graphs. Numeriche Mathematik (1959) 1 269 271 Crossref, Google Scholar
• Fredman M. L. , Tarjan R. E. Fibonacci heaps and their uses in improved network optimization algorithms. JACM (1987) 34 596 615 Crossref, Google Scholar
• Gallo G. , Pallottino S. Shortest paths algorithms. Ann. Oper. Res. (1988) 13 3 79 Crossref, Google Scholar
• Glover F. , Glover R. , Klingman D. Computational study of an improved shortest path algorithm. Networks (1984) 14 25 37 Crossref, Google Scholar
• Glover F. , Klingman D. , Philips N. A new polynomially bounded shortest paths algorithm. Oper. Res. (1985) 33 65 73 Link, Google Scholar
• Goldberg A. V. , Radzik T. A heuristic improvement of the Bellman–Ford algorithm. Appl. Math. Lett. (1993) 6 3 6 Crossref, Google Scholar
• Hung M. H. , Divoky J. J. A computational study of efficient shortest path algorithms. Comp. Oper. Res. (1988) 15 567 576 Crossref, Google Scholar
• Mondou J.-F. , Crainic T. G. , Nguyen S. Shortest path algorithms: A computational study with the C programming language. Comp. Oper. Res. (1991) 18 767 786 Crossref, Google Scholar
• Pallottino S. Shortest-path methods: Complexity, interrelations, and new propositions. Networks (1984) 14 257 267 Crossref, Google Scholar
• Pape U. Implementation and efficiency of moore algorithms for the shortest root problem. Math. Program. (1974) 7 212 222 Crossref, Google Scholar