Abstract
We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of shortest paths algorithms. The interaction between the experimental evaluation of algorithm behavior and the theoretical analysis of algorithm performance plays an important role in our research.
Similar content being viewed by others
References
R.K. Ahuja, K. Mehlhorn, J.B. Orlin and R.E. Tarjan, “Faster algorithms for the shortest path problem”,J. Assoc. Comput. Mach. 37 (2) (1990) 213–223.
R.E. Bellman, “On a routing problem”,Quart. Appl. Math. 16 (1958) 87–90.
P. van Emde Boas, R. Kaas and E. Zijlstra, “Design and implementation of an efficient priority queue”,Math. Syst. Theory 10 (1977) 99–127.
T.H. Cormen, C.E. Leiserson and R.L. Rivest,Introduction to Algorithms (MIT Press, Cambridge, MA, 1990).
E.V. Denardo and B.L. Fox, “Shortest-route methods: 1. Reaching, pruning, and buckets”,Operations Research 27 (1979) 161–186.
R.B. Dial, “Algorithm 360: Shortest path forest with topological ordering”,Comm. ACM 12 (1969) 632–633.
R.B. Dial, F. Glover, D. Karney and D. Klingman, “A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees”,Networks 9 (1979) 215–248.
E.W. Dijkstra, “A note on two problems in connection with graphs”,Numer. Math. 1 (1959) 269–271.
R.E. Erickson, C.L. Monma and A.F. Veinott Jr., “Send-and-split method for minimum-concave-cost network flows”,Math. of Oper. Res. 12 (1979) 634–664.
L.R. Ford Jr., and D.R. Fulkerson,Flows in Networks (Princeton Univ. Press, Princeton, NJ, 1962)
M.L. Fredman and R.E. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms”,J. Assoc. Comput. Mach. 34 (1987) 596–615.
M.L. Fredman and D.E. Willard, “Trans-dichotomous algorithms for minimum spanning trees and shortest paths”,J. Comp. and Syst. Sci. 48 (1994) 533–551.
H.N. Gabow and R.E. Tarjan, “Faster scaling algorithms for network problems”,SIAM J. Comput. (1989) 1013–1036.
G. Gallo and S. Pallottino, “Shortest paths algorithms”,Annals of Oper. Res. 13 (1988) 3–79.
F. Glover, R. Glover and D. Klingman, “Computational study of an improved shortest path algorithm”,Networks 14 (1984) 25–37.
F. Glover, D. Klingman and N. Phillips, “A new polynomially bounded shortest paths algorithm”,Oper. Res. 33 (1985) 65–73.
A.V. Goldberg, “Scaling algorithms for the shortest paths problem”, in:Proceedings 4th ACM-SIAM Symposium on Discrete Algorithms (1993) 222–231.
A.V. Goldberg and T. Radzik, “A heuristic improvement of the Bellman-Ford algorithm”,Applied Math. Let. 6 (1993) 3–6.
M.S. Hung and J.J. Divoky, “A computational study of efficient shortest path algorithms”,Comput. Oper. Res. 15 (1988) 567–576.
D.S. Johnson and C.C. McGeoch, eds.,Network Flows and Matching: First DIMACS Implementation Challenge (AMS, 1993).
A. Kershenbaum, “A note on finding shortest paths trees”,Networks 11 (1981) 399.
E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt Reinhart, and Winston, New York 1976).
B.Ju. Levit and B.N. Livshits,Neleneinye Setevye Transportnye Zadachi (Transport, Moscow, 1972), in Russian.
J-F. Mondou, T.G. Crainic and S. Nguyen, “Shortest path algorithms: A computational study with the C programming language”,Comput. Oper. Res. 18 (1991) 767–786.
E.F. Moore, “The shortest path through a maze”, in:Proceedings of the Int. Symp. on the Theory of Switching (Harvard University Press, 1959) 285–292.
S. Pallottino, “Shortest-path methods: Complexity, interrelations and new propositions”,Networks 14 (1984) 257–267.
U. Pape, “Implementation and efficiency of Moore algorithms for the shortest root problem”,Math. Prog. 7 (1974) 212–222.
D. Shier and C. Witzgall, “Properties of labeling methods for determining shortest paths trees”,J. Res. Natl. Bur. Stand. 86 (1981) 317–330.
R.E. Tarjan,Data Structures and Network Algorithms (Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983).
Author information
Authors and Affiliations
Additional information
This work was done while Boris V. Cherkassky was visiting Stanford University Computer Science Department and supported by the NSF and Powell Foundation grants mentioned below.
Andrew V. Goldberg was supported in part by ONR Young Investigator Award N00014-91-J-1855, NSF Presidential Young Investigator Grant CCR-8858097 with matching funds from AT&T, DEC, and 3M, and a grant from Powell Foundation. Corresponding author.
This work was done while Tomasz Radzik was a Postdoctoral Fellow at SORIE, Cornell University, and supported by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550, and by the Packard Fellowship of Éva Tardos.
Rights and permissions
About this article
Cite this article
Cherkassky, B.V., Goldberg, A.V. & Radzik, T. Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming 73, 129–174 (1996). https://doi.org/10.1007/BF02592101
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02592101