A New Shortest Paths Ranking Algorithm

Ranking shortest paths is a classical network problem consisting of the determination of the K shortest paths connecting a given initial{destination pair of nodes such as the distance of the k th path that is determined is no greater than the distance of any j th one, for some j > k. In this paper an algorithm for ranking paths is reviewed being its complexity improved in terms of the required memory space. This improvement allows the ranking of really larger problems in reasonably small execution times, which is comproved by the presented computational experiments. In fact, for randomly generated networks with 10000 nodes, the algorithm ranks more than half of a million of paths in a few cents of seconds of CPU execution time. This performance can be very important because of the potential practical applications of the problem, nameley as a subproblem of the constrained shortest path problem and of the multiobjective shortest path problem.

[1]  E. Martins.  An algorithm for ranking paths that may contain cycles , 1984 .

[2]  Narsingh Deo,et al.  Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.

[3]  G. Gallo,et al.  SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .

[4]  Jin Y. Yen.  Shortest path network problems , 1975 .

[5]  Ernesto de Queirós Vieira Martins,et al.  A Shortest Paths Ranking Algorithm , 1990 .

[6]  Y. Aneja,et al.  The constrained shortest path problem , 1978 .

[7]  F. Glover,et al.  A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

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

[9]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

[10]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[11]  Douglas R. Shier,et al.  On algorithms for finding the k shortest paths in a network , 1979, Networks.

[12]  E. Martins,et al.  An algorithm for the ranking of shortest paths , 1993 .

[13]  E. Denardo,et al.  Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[14]  Alexander Bockmayr,et al.  Network Flow Problems in Constraint Programming , 2001, CP.

[15]  E. Martins,et al.  A bicriterion shortest path algorithm , 1982 .

[16]  Douglas R. Shier,et al.  Iterative methods for determining the k shortest paths in a network , 1976, Networks.

[17]  E. Martins.  On a multicriteria shortest path problem , 1984 .

[18]  E. Martins,et al.  A computational improvement for a shortest paths ranking algorithm , 1994 .

[19]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[20]  E. Lawler.  Shortest Path and Network Flow Algorithms , 1979 .

[21]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .