A simple and fast label correcting algorithm for shortest paths

We propose a new method for ordering the candidate nodes in label correcting methods for shortest path problems. The method is equally simple but much faster than the D’ Esopo-Pape algorithm. It is similar to the threshold algorithm in that it tries to scan nodes with small labels as early as possible, and performs comparably with that algorithm. Our algorithm can also be combined with the threshold algorithm thereby considerably improving the practical performance of both algorithms.

[1]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

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

[3]  D. Klingman,et al.  NETGEN - A Program for Generating Large Scale (Un) Capacitated Assignment, Transportation, and Minim , 1974 .

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

[5]  Bruce L. Golden,et al.  Technical Note - Shortest-Path Algorithms: A Comparison , 1976, Oper. Res..

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

[7]  Aaron Kershenbaum,et al.  A note on finding shortest path trees , 1981, Networks.

[8]  Douglas R. Shiert,et al.  Properties of Labeling Methods for Determining Shortest Path Trees , 1981 .

[9]  Stefano Pallottino,et al.  Shortest-path methods: Complexity, interrelations and new propositions , 1984, Networks.

[10]  Fred W. Glover,et al.  Computational study of an improved shortest path algorithm , 1984, Networks.

[11]  F. Glover,et al.  New Polynomial Shortest Path Algorithms and Their Computational Attributes , 1985 .

[12]  Fred W. Glover,et al.  A New Polynomially Bounded Shortest Path Algorithm , 1985, Oper. Res..

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

[14]  Giorgio Gallo,et al.  Shortest path algorithms , 1988 .

[15]  Dimitri P. Bertsekas,et al.  Linear network optimization - algorithms and codes , 1991 .

[16]  Dimitri P. Bertsekas,et al.  An Auction Algorithm for Shortest Paths , 1991, SIAM J. Optim..

[17]  Dimitri P. Bertsekas,et al.  Polynomial auction algorithms for shortest paths , 1995, Comput. Optim. Appl..