Efficiency evaluation of shortest path algorithms

While the ever growing computational capabilities of devices that are used for man-machine interaction are taken for granted, the need to find their most optimum use is as important as ever. This issue is particularly relevant when considering solutions where the determination of the shortest path between given points (nodes) is one of the basic operations. In more complex executions of the shortest paths, sets of paths with the shortest distance between a single initial (source) point and all other destination points, as well as between all pairs of points, are to be found. For each of these approaches, individual algorithms with specific features have been worked out over the past decades. With that in mind, the present article seeks to explore this problem and is structured in such a way as to describe some of the selected algorithms solving the shortest path problem, and to analyse the efficiency of these algorithms during their operation in directed graphs of different type. The study shows that the efficiency varies among algorithms under investigation and allows to suggest which one ought to be used to solve a specific variant of the shortest path problem. Keywords-shortest path; algorithms; efficiency; evaluation

[1]  U. Pape,et al.  Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[2]  P. K. Mishra,et al.  Computational Efficiency of Optimized Shortest Path Algorithms , 2005, Int. J. Comput. Sci. Appl..

[3]  D. Bertsekas,et al.  Parallel asynchronous label-correcting methods for shortest paths , 1996 .

[4]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[5]  Reuven Cohen,et al.  On the Computational Complexity and Effectiveness of N-Hub Shortest-Path Routing , 2004, IEEE/ACM Transactions on Networking.

[6]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[7]  Sven Völker,et al.  The shortest path: Comparison of different approaches and implementations for the automatic routing of vehicles , 2012, Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC).

[8]  Andrew V. Goldberg,et al.  Shortest-path feasibility algorithms: An experimental evaluation , 2008, JEAL.

[9]  Piotr Zwierzykowski,et al.  Lagrangian relaxation in the multicriterial routing , 2011, IEEE Africon '11.

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  Piotr Zwierzykowski,et al.  Shortest Path Problem Solving Based on Ant Colony Optimization Metaheuristic , 2012 .

[12]  Ulrich Lauther,et al.  An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Road Networks with Precalculated Edge-Flags , 2006, The Shortest Path Problem.

[13]  Yagvalkya Sharma,et al.  Comparison of Dijkstra’s Shortest Path Algorithm with Genetic Algorithm for Static and Dynamic Routing Network , 2012 .

[14]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[15]  Uri Zwick,et al.  On Dynamic Shortest Paths Problems , 2004, Algorithmica.

[16]  B. Golden.  Shortest-Path Algorithms: A Comparison , 1975 .

[17]  Dimitri P. Bertsekas,et al.  A simple and fast label correcting algorithm for shortest paths , 1993, Networks.

[18]  Kun-Mao Chao,et al.  Spanning trees and optimization problems , 2004, Discrete mathematics and its applications.

[19]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[20]  Giuseppe F. Italiano,et al.  Experimental analysis of dynamic all pairs shortest path algorithms , 2004, SODA '04.

[21]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[22]  Shane Saunders,et al.  A Comparison of Data Structures for Dijkstra's Single Source Shortest Path Algorithm , 1999 .

[23]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

[24]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[25]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[26]  Amit M. Bhosle,et al.  On the difficulty of some shortest path problems , 2003, TALG.

[27]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[28]  Seth Pettie,et al.  On the Comparison-Addition Complexity of All-Pairs Shortest Paths , 2002, ISAAC.

[29]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.