Abstract
A survey of shortest path methods is presented. All the algorithms described are shown to derive from one single prototype method, the difference between them depending only on the particular data structure used in their implementation. This analysis suggests a new classification of the shortest path algorithms. Both the single shortest path tree problem and the all-pairs shortest path problem are considered. One section is dedicated to reoptimization procedures.
Research performed for the SOFMAT (Mathematical Software) activities of the Italian National Research Council (C.N.R.) ‘Progetto Finalizzato Informatica’.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms (Addison-Wesley, Reading, MA, 1974).
M.S. Bazaraa and R.W. Langley, “A dual shortest path algorithm”, SIAM Journal on Applied Mathematics 26 (1974) 496–501.
R. Bellman, “On a routing problem”, Quarterly of Applied Mathematics 16 (1958) 88–90.
J.S. Carson and A.M. Law, “A note on Spira’s algorithm for the all-pairs shortest-path problem”, SIAM Journal on Computing 6 (1977) 696–699.
G.B. Dantzig, Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).
G.B. Dantzig, “All shortest routes in a graph”, in: Theory of graphs, international symposium, Rome 1966 (Dunod, Paris, 1967) 91–92.
E.V. Denardo and B.L. Fox, “Shortest-route methods. I. Reaching, pruning, and buckets”, Operations Research 27 (1979) 161–186.
R.B. Dial, “Algorithm 360: Shortest path forest with topological ordering”, Communications of the ACM 12 (1969) 632–633.
R. 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 connexion with graphs”, Numerische Mathematik 1 (1959) 269–271.
R. Dionne, “Etude et extension d’un algorithme de Murchland”, Infor 16 (1978) 132–146.
R. Dionne and M. Florian, “Exact and approximate algorithms for optimal network design”, Networks 9 (1979) 37–59.
S.E. Dreyfus, “An appraisal of some shortest-path algorithms”, Operations Research 17 (1969) 395–412.
J. Edmonds and R.M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems”, Journal of the ACM 19 (1972) 248–264.
M. Florian, “An improved linear approximation algorithm for the network equilibriums (packet switching) problem”, Proceedings of the IEEE Conference on Decision and Control (1977).
M. Florian, S. Nguyen and S. Pallottino, “A dual simplexs algorithm for finding all shortest paths”, Networks 11 (1981) 367–378.
R.W. Floyd, “Algorithm 97: Shortest path”, Communications of the ACM 5 (1962) 345.
L.R. Ford, “Network flow theory”, Report No. P-293, Rand Corporation (1956).
S. Fujishige, “A note on the problem of updating shortest paths”, Networks 11 (1981) 317–319.
G. Gallo, “Reoptimization procedures in shortest path problems”, Rivista di Matematica per le Science Economiche e Sociali 3 (1980) 3–13.
G. Gallo, “Updating shortest paths in large scale networks”, presented at the International Workshop on Advances in Linear Optimization Algorithms and Software (Pisa, Italy, 1980), to appear in Networks.
G. Gallo, “Lower planes for the network design problem”, Networks 13 (1983) 411–425.
G. Gallo and S. Pallottino, “Problemi di cammini ottimi”, Rapporto 13.81, C.N.R.-P.F.Informatica-SOFMAT (Rome, Italy, 1981) 5–59.
G. Gallo and S. Palottino, “A new algorithm to find the shortest paths between all pairs of nodes”, Discrete Applied Mathematics 4 (1982) 23–35.
G. Gallo and S. Pallottino, “Shortest path methods in transportation models”, to appear in: M. Florians, ed., Transportation planning models (North-Holland Amsterdam, 1984).
G. Gallo, S. Pallottino and C. Ruggeri, “Efficienza sperimentale di algoritmi di cammino minimo”, Rapporto 28.82, C.N.R.-P.F. Informatica-SOFMAT (Rome, Italy, 1982).
G. Gallo, S. Pallottino, C. Ruggeri and G. Storchi, “Shortest paths: A bibliography”, Rapporto 27.82, C.N.R.-P.F.Informatica-SOFMAT (Rome, Italy, 1982).
J. Gilsinn and C. Witzgall, “A performance comparison of labeling algorithms for calculating shortest path trees”, Technical Note 772, National Bureau of Standards (Washington, DC, 1973).
F. Glover and D. Klingman, “Recent development in computer implementation technology for network flow algorithms”, presented at the International Workshop on Advances in Linear Optimization Algorithms and Software (Pisa, Italy, 1980).
B. Golden, “Shortest path algorithms: A comparison”, Operations Research 24 (1976), 1164–1168.
S. Goto and A. Sangiovanni-Vincentelli, “A new shortest path updating algorithm”, Networks 8 (1978) 341–372.
P. Hansen, “An O(m·log D) algorithm for shortes paths”, Discrete Applied Mathematics 2 (1980) 151–153.
T.C. Hu, “Revised matrix algorithms for shortest paths”, SIAM Journal on Applied Mathematics 15 (1967) 207–218.
D.B. Johnson, “Algorithms for shortest paths”, Ph.D. dissertation, Cornell University (Ithaca, NY, 1973).
D.B. Johnson, “A note on Dijkstra’s shortest path algorithm”, Journal of the ACM 20 (1973) 385–388.
D.B. Johnson, “Efficient algorithms for shortest paths in sparse networks”, Journal of the ACM 24 (1977) 1–13.
E.L. Johnson, “On shortest paths and sorting”, Proceedings of the 25th A.C.M. Annual Conference (1972) 510–517.
R.G. Karlsson and P.V. Poblete, “An O(m log log D) algorithm for shortest paths”, Discrete Applied Mathematics 6 (1983) 91–93.
A. Kershenbaum, “A note on finding shortest path trees”, Networks 11 (1981) 399–400.
D.E. Knuth, The art of computer programming, Vol. 1: fundamental algorithms(Addison-Wesley, Reading, MA, 1968).
D.E. Knuth, The art of computer programming, Vol. 3: sorting and searching (Addison-Wesley, Reading, MA, 1973).
E.L. Lawler, Combinatorial optimization: networks and matroids (Holt, Rinehart and Winston, New York, NY, 1976).
E.L. Lawler, “Shortest path and network flow algorithms”, Annals of Discrete Mathematics 4 (1979) 251–263.
T.L. Magnanti and R.T. Wong, “Network and transportation planning: Models and algorithms”, Transportation Science 18 (1984) 1–55. on Transportation Science (1983).
E.F. Moore, “The shortest path through a maze”, Proceedings of the International Symposium on Theory of Switching (1957) (Harvard University Press, Cambridge, MA, 1959) 285–292.
J.D. Murchland, “The effect of increasing or decreasing the length of a single are on all shortest distances in a graph”, Report LBS-TNT-26, London Graduate School of Business Studies (1967).
G.L. Nemhauser, “A generalized permanent label setting algorithm for the shortest path between specified nodes”, Journal of Mathematical Analysis and Application 38 (1972) 328–334.
S. Pallottino, “Adaptation de l’algorithme de D’Esopo-Pape pour la determination de tous les chemins les plus courts: ameliorations et simplifications”, Publication 136, Centre de Recherches sur les Transports, University of Montreal (Montreal, Canada, 1979).
S. Pallottino, “Shortest path method: Complexity, interrelations and new proposition”, Networks 14 (1984) 257–267.
U. Pape, “Zur Implementierungs und Wirtschaftlichkeit von Moore-Algorithmens zur Bestimmung kürzester Weglängen in einem Netzwerk”, Bericht 73-06, Fachbereich 20 (Kybernetik), Technische Universität Berlin (Berlin, 1973).
U. Pape, “Netzwerk-Veraenderungen und Korrektur kuerzester Weglaengen von einer Wurzelmenge zu allen anderen Knoten”, Computing 12 (1974) 357–362.
U. Pape, “Implementation and efficiency of Moore-algorithms for the shortes route problem”, Mathematical Programming 7 (1974) 212–222.
U. Pape, “Algorithm 562: shortest path lengths”, ACM Transactions on Mathematical Software 6 (1980) 450–455.
U. Pape, “Remark on algorithm 562”, ACM Transactions on Mathematical Software 9 (1983) 260.
M. Pollack and W. Wiebenson, “Solutions of the shortest-route problem: a review”, Operations Research 8 (1960) 224–230.
V.V. Rodionov, “The parametric problem of shortest distances”, U.S.S.R. Computational Mathematics and Mathematical Physics 8 (1968) 336–343.
D.R. Shier and C. Witzgall, “Properties of labeling methods for determining shortest path trees”, Journal of Research of the National Bureau of Standards 86 (1981) 317–330.
B. Simeone, Private communication (Bologna, Italy, 1980).
P.M. Spira, “A new algorithm for finding all shortest paths in a graph of positive arcs in average time O(n 2·log2 n)”, SIAM Journal on Computing 2 (1973) 28–32.
P.M. Spira and A. Pan, “On finding and updating spanning trees and shortest paths”, SIAM Journal on Computing 4 (1975) 375–380.
Y. Tabourier, “All shortest distances in a graph. An improvement to Dantzig’s inductive algorithm”, Discrete Mathematics 4 (1973) 83–87.
T. Takaoka and A. Moffat, «An O(n 2·log n· log log n) expected time algorithm for the all shortest distance problem”, Lecture notes in computer science 88 (Springer-Verlag, Berlin, 1980) 643–655.
R.E. Tarjan, “Complexity of combinatorial algorithms”, SIAM Review 20 (1978) 457–491.
D. Van Vliet, “Improved shortest path algorithms for transport networks”, Transportation Research 12 (1978) 7–20.
S. Warshall, “A theorem on Boolean matrices”, Journal of the ACM 9 (1962) 11–12.
J.W.J. Williams, “Algorithm 232: Heapsort”, Communications of the ACM 7 (1964) 347–348.
B. Yaged, “Minimum cost routing for static network models”, Networks 1 (1971) 139–172.
J.Y. Yen, “Finding the length of all shortest paths in n-node nonnegative-distance complete networks using n 3/2 additions and n 3 comparisons”, Journal of the ACM 19 (1972) 423–424.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Gallo, G., Pallottino, S. (1986). Shortest path methods: A unifying approach. In: Gallo, G., Sandi, C. (eds) Netflow at Pisa. Mathematical Programming Studies, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121087
Download citation
DOI: https://doi.org/10.1007/BFb0121087
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00922-8
Online ISBN: 978-3-642-00923-5
eBook Packages: Springer Book Archive