Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
References
All Topics
Mathematics
Applied Mathematics

An Appraisal of Some Shortest-Path Algorithms

Profile image of Stuart DreyfusStuart Dreyfus

1969, Operations Research

Abstract
sparkles

AI

This paper presents a survey of various shortest-path algorithms, focusing on the efficiency and the computational complexity involved. It intends to provide insights into the performance of these algorithms under varying network structures and conditions, emphasizing that the choice of algorithm should consider the specific problem structure, computing environment, and the programming languages employed. Dijkstra's algorithm is highlighted as a notable procedure for determining the shortest path, with comparisons made to other methods to underscore performance differences.

Related papers

A new algorithm for the shortest-path problem
Ahmed Shokry

Networks, 2018

In this article we propose a new single‐source shortest‐path algorithm that achieves the same O(n · m) time bound as the Bellman‐Ford‐Moore algorithm but outperforms it and other state‐of‐the‐art algorithms in many cases in practice. Our claims are supported by experimental evidence.

View PDFchevron_right
The generalized shortest path problem
Vladimir Batagelj

CiteSeer Archives, 2000

We consider generalized shortest path problems with cost and weight functions for the arcs of a graph. According to their weight arcs may generate or consume ow. Weights may be additive or multiplicative on a path. More precisely, if x units enter an arc a = (u; v) then x + w(a) resp. x w(a) leave it. The cost is charged per unit and summed over the edges of a path.

View PDFchevron_right
A Survey of Shortest-Path Algorithms
Faizan Rehman

ArXiv, 2017

A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph. A plethora of shortest-path algorithms is studied in the literature that span across multiple disciplines. This paper presents a survey of shortest-path algorithms based on a taxonomy that is introduced in the paper. One dimension of this taxonomy is the various flavors of the shortest-path problem. There is no one general algorithm that is capable of solving all variants of the shortest-path problem due to the space and time complexities associated with each algorithm. Other important dimensions of the taxonomy include whether the shortest-path algorithm operates over a static or a dynamic graph, whether the shortest-path algorithm produces exact or approximate answers, and whether the objective of the shortest-path algorithm is to achieve time-dependence or is to only be goal directed. This survey studies and classifies shortest-path algorithms according to the proposed taxonomy. Th...

View PDFchevron_right
The Shortest-Path Problem: Analysis and Comparison of Methods
Diego R. Llanos

Synthesis Lectures on Theoretical Computer Science, 2014

Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques. Since several of these improvements involve subtle changes to the search space, it may be difficult to appreciate their benefits in terms of time or space requirements. To make methods more comprehensive and to facilitate their comparison, this book presents a single case study that serves as a common benchmark. The paper also compares the search spaces explored by the methods described, both from a quantitative and qualitative point of view, and including an analysis of the number of reached and settled nodes by different methods for a particular topology.

View PDFchevron_right
A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs
Chee Yap

Information Processing Letters, 1983

View PDFchevron_right
The origin-destination shortest path problem
James Orlin
View PDFchevron_right
Improved algorithm for finding next-to-shortest paths
shisheng li

Information Processing Letters, 2006

We study the problem of finding the next-to-shortest paths in a weighted undirected graph. A next-to-shortest (u, v)-path is a shortest (u, v)-path amongst (u, v)-paths with length strictly greater than the length of the shortest (u, v)-path. The first polynomial algorithm for this problem was presented in [I. Krasikov, S.D. Noble, Finding next-to-shortest paths in a graph, Inform. Process. Lett. 92 (2004) 117-119]. We improve the upper bound from O(n 3 m) to O(n 3).

View PDFchevron_right
Solving the Nearly Symmetric All-Pairs Shortest-Path Problem
Gerald G. Brown

INFORMS Journal on Computing

We introduce a simple modification to the repeated shortest-path algorithm for the all-pairs shortest-path problem that adds a cumulative distance-label update at each iteration based on the shortest-path tree from the prior iteration. We have implemented and tested our update using several shortest-path algorithms on a range of test networks of varying size, degree, and "skewness" (i.e., asymmetry) of costs on antisymmetric arcs, and we find that it provides a significant speedup to any such algorithm except for cases in which either the underlying graph is extremely sparsely connected (or even disconnected), or when the arc costs are highly nonsymmetric. An added charm is that our best modified method preserves the polynomial worstcase runtime of its label-correcting antecedent. As with other repeated-shortest-path algorithms, it is significantly faster than the Floyd-Warshall algorithm on sparsely connected networks, and even on some fairly densely connected networks.

View PDFchevron_right
Faster algorithms for the shortest path problem
Robert Tarjan

Journal of the ACM, 1990

Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the radix heap , is proposed for use in this algorithm. On a network with n vertices, m edges, and nonnegative integer arc costs bounded by C , a one-level form of radix heap gives a time bound for Dijkstra's algorithm of O ( m + n log C ). A two-level form of radix heap gives a bound of O ( m + n log C /log log C ). A combination of a radix heap and a previously known data structure called a Fibonacci heap gives a bound of O ( m + n a @@@@log C ). The best previously known bounds are O ( m + n log n ) using Fibonacci heaps alone and O ( m log log C ) using the priority queue structure of Van Emde Boas et al. [ 17].

View PDFchevron_right
Review of Shortest Path Algorithm
pijush kumar

International Journal of Computer Science and Mobile Computing

Shortest path algorithm. Graphs are an example of non-linear data structure. A graph is a collection of nodes which are connected by edges. The definition of graph G = (V, E) is basically a collection of vertices and edges. Graphs can be classified on the basis of types of edges. Directed graphs have each of the edges directed which means the edges connecting the two nodes defines the way it is connected from and to. On the other side, undirected graphs have edges which have no direction. The edges of a graph have weights which are associated with it. The weight of an edge can be thought as the cost of the edge. Let’s assume there are two vertices representing two cities, then the weight of the edge between the vertices may represent the distance between the cities. Given a given graph and a particular node, we can find a path of least total weight from that node to other vertices of the graph. The total weight of the path will be the sum of the weights of the edges. Graphs can be u...

View PDFchevron_right

References (32)

  1. Dijkstra, E. W., "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, Vol. 1, 1959, pp. 269-271.
  2. Whiting, P. D., and J. A. Hillier, "A Method for Find- ing the Shortest Route through a Road Network," Operational Research Quarterly, Vol. 11, Nos. 1/2, March/Jume 1960, pp. 37-40.
  3. Pollack, M., and W. Wiebenson, "Solution of the Shortest-Route Problem--A Review," Op. Res., Vol. 8, No. 2, March-April 1960, pp. 224-230.
  4. Ford, L. R., Jr., and n. R. Fulkerson, "Constructing Maximal Dynamic Flows from Static Flows," Op. Res., Vol. 6, No. 3, May-June 1958, pp. 419-433.
  5. Dantzig, G. B., "On the Shortest Route through a Net- work," Management Science, Vol. 6, No. 2, January 1960, pp. 187-190. See also Ref. 7.
  6. Berge, C., and A. Ghouila-Houri, Programming, Games and Transportation Networks, trans. by M. Merrington and C. Ramanujacharyulu, Methuen, London, 1965, p. 176.
  7. Dantzig, G. B., Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey, 1963, pp. 363-366.
  8. Nicholson, T.A.J., "Finding the Shortest Route Between Two Points in a Network," The Computer Journal, Vol.
  9. Murchland, J. D., The "Once-Through" Method of Finding all Shortest Distances in a Graph from a Single Origin, Transport Network Theory Unit, London Graduate School of Business Studies, Report LBS-TNT- 56, August 1967.
  10. Ford, L. R., Jr., Network Flow Theory, The RAND Cor- poration, P-923, August 1956.
  11. Moore, E. F., "The Shortest Path through a Maze," Proc. Int. Symp. on the Theory of Switching, Part II, April 2-5, 1957, The Annals of the Computation Laboratory of Harvard University 30, Harvard University Press, 1959, pp. 285-292.
  12. Bellman, R. E., "On a Routing Problem," Quart. Appl. Math., Vol. XVI, No. 1, April 1958, pp. 87-90.
  13. Yen, J. Y., Matrix Algorithm for Solving All Shortest Routes from a Fixed Origin in the General Networks, Graduate School of Business Administration, Uni- versity of California, Berkeley (unpublished manuscript).
  14. Dantzig, G. B., W. 0. Blattner, and M. R. Rao, All Shortest Routes from a Fixed Origin in a Graph, Operations Research House, Stanford University, Technical Report 66-2, November 1966.
  15. Hitchner, L. E., A Comparative Investigation of the Computational Efficiency of Shortest Path Algorithms, Operations Research Center, University of California, Berkeley, Report ORC 68-17, July 1968.
  16. Floyd, R. W., "Algorithm 97, Shortest Path," Comm. ACM, Vol. 5, No. 6, June 1962, p. 345.
  17. Warshall S., "A Theorem on Boolean Matrices," J. ACM) Vol.
  18. Murchland, J. D., A New Method for Finding all Ele- mentarv Paths in a Complete Directed Graph, Trans- port Network Theory Unit, London School of Economics, Report LSE-TNT-22, October 1965.
  19. Dantzig, G. B., All Shortest Routes in a Graph, Opera- tions Research House, Stanford Univerfity, Technical Report 66-3, November 1966.
  20. Shimbal, A., "Structure in Communication Nets," Proc. of the Symposium on Information Networks, Poly- technic Institute of Brooklyn, April 12-14, 1954.
  21. "Investigation of Model Techniques," Second Annual Report, July 1957-1958, Case Institute of Tech- nology, Cleveland, Ohio, ASTIA Report AD211968.
  22. Hu, T. C., "Revised Matrix Algorithms for Shortest Paths," SIAM J. on Appl. Math., Vol. 15, No. 1, January 1967, pp. 207-218.
  23. Hoffman, W., and R. Pavley, "A Method for the Solution of the Nth Best Path Problem," J. ACM, Vol. 6, No. 4, October 1959, pp. 506-514.
  24. Bellman, R., and R. Kalaba, "On kth Lest Policies," J. SIAM, Vol. 8, No. 4, December 1960, pp. 582-588. ,
  25. Pollack, M., "Solutions of the kth Best Route through a Network--A Review," J. Math. Anal. and Appi., Vol. 3, August-December 1961, pp. 547-559.
  26. Sakarovitch, M., The k Shortest Routes and the k Shortest Chains in a Graph, Operations Research Center, Univarsity of California, Berkeley, Report ORC 66-32, October 1966.
  27. Clarke, S., A. Krikorian, and J. Rausen, "Computing the N Best Loopless Paths in a Network," J. SIA•, Vol. 11, No. 4, December 1963, pp. 1096-1102.
  28. Elmaghraby, S. E., The Shortest Route Problem: Survey and Extensions, Yale University, Septetber 1966 (unpublished manuscript).
  29. Pollack, M., "The kth Best Route through a Network," Op. Res., Vol. 9, No. 4, July-August 1961, pp, 578-580.
  30. Cooke, K. L., and E. Halsey, "The Shortest Route through a Network with Time-Dependent Internodal Transit Times," J. Math. Aral. and Appl., Vol. 14, No. 3, June 1966, pp. 493-498.
  31. Saksena, J. P., and S. Kumar, "The Routing Problem with 'K' Specified Nodes," Op. Res., Vol. 14, No. 5, September-October 1966, pp. 909-913.
  32. Bellmore, M., and G. L. Nemhauser, "The Traveling Salesman Problem: A Survey," Op. Res., Vol. 16, No. 3, May-June 1968, pp. 538-558.

Related papers

A new algorithm to find the shortest paths between all pairs of nodes
Giorgio Gallo

Discrete Applied Mathematics, 1982

A new algorithm to find the shortest paths between all pairs of nodes is presented. This algorithm makes use of a dual cost transformation and of a particular data structure. Its worst case time complexity is of the order of the third power of the number of nodes, and its space complexity is linear with the number of arcs. A comparison with existing algorithms is presented.

View PDFchevron_right
Shortest Path Algorithms between Theory and Practice
Ahmed Shokry

MSc Thesis, 2019

Utilizing graph algorithms is a common activity in computer science. Algorithms that perform computations on large graphs are not always efficient. This work investigates the Single-Source Shortest Path (SSSP) problem, which is considered to be one of the most important and most studied graph problems. This thesis contains a review of the SSSP problem in both theory and practice. In addition, it discusses a new single-source shortest-path algorithm that achieves the same $O(n \cdot m)$ time bound as the traditional Bellman-Ford-Moore algorithm but outperforms it and other state-of-the-art algorithms in practice. The work is comprised of three parts. The first discusses some basic shortest-path and negative-cycle-detection algorithms in literature from the theoretical and practical point of view. The second contains a discussion of a new algorithm for the single-source shortest-path problem that outperforms most state-of-the-art algorithms for several well-known families of graphs. The main idea behind the proposed algorithm is to select the fewest most-effective vertices to scan. We also propose a discussion of correctness, termination, and the proof of the worst-case time bound of the proposed algorithm. This section also suggests two different implementations for the proposed algorithm, the first runs faster while the second performs a fewer number of operations. Finally, an extensive computational study of the different shortest paths algorithms is conducted. The results are proposed using a new evaluation metric for shortest-path algorithms. A discussion of outcomes, strengths, and weaknesses of the various shortest path algorithms are also included in this work.

View PDFchevron_right
Shortest Paths and Networks
Joseph Mitchell

Handbook of Discrete and Computational Geometry, Second Edition, 2004

View PDFchevron_right
Review and Performance Analysis of Shortest Path Problem Solving Algorithms
Piotr Zwierzykowski, Mariusz Glabowski (Głąbowski)

The International Journal on Advances in Software, ISSN: 1942-2628, vol. 7, no. 1& 2,year 2014,, 2014

The development of concepts derived from the generic approach to solving the problem of the shortest path resulted in numerous and various algorithms that appeared over the past decades. The studies on the most basic operation aimed at the determination of the shortest path between two given points in a graph (in other words, often a network) have resulted in sophisticated solutions designed for more and more demanding applications. Those include finding the sets of paths with the shortest distance between all pairs of nodes or searching for a shortest path tree. The aim of the present article is to give the reader an introduction to the problem of the shortest path and a detailed review of two groups of selected algorithms designed to solve particular problems. In the study described herein, different algorithms have been examined for their efficacy in their operation in directed graphs of different type represented in a well-defined data structure. The empirical simulation-based analysis proves that the performance varies among algorithms under investigation and allows to suggest, which methods ought to be used to solve specific variants of the shortest path problem and which algorithms should be avoided or used with caution.

View PDFchevron_right
An algorithm for the ranking of shortest paths
Joaquim Ernesto

European Journal of Operational Research, 1993

An efficient computational implementation of a path deletion K shortest paths algorithm and a new algorithm for the same problem are presented. In a path deletion K shortest paths algorithm a sequence {~'1, ~'2 ..... fir} of networks is defined, such that ~'t is the given network and its k-th shortest path is trivially determined from the shortest path in fig" In essence, as soon as the shortest path in ~'k is determined it is excluded from fig in such a way that no new paths are formed and no more paths are deleted. So, for each ~'k, twO procedures are executed: a shortest path algorithm and a path deletion algorithm. In the presented computational implementation, all the information resulting from the determination of the k-th shortest path is carried throughout ~k+l, ~'k+2,'-', ~K" The new algorithm not only keeps this characteristic but also avoids the last K-1 executions of a shortest path algorithm, which results in a surprising and very substantial reduction in the execution time. In fact, for randomly generated networks with 104 nodes and l0 s arcs, once the shortest path is determined, the new algorithm computes the next 100 shortest paths in times of the order of 10-1 seconds. To illustrate the efficiency of this algorithm, comparative computational experiments are reported.

View PDFchevron_right

Related topics

  • Applied Mathematics
  • Computer Science
  • Algorithms
  • Operations Research
  • Business and Management
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved