Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept

In this paper, the problem of finding a shortest path tree rooted at a given source node on a directed graph (SPT) is considered. A new efficient algorithm based on a primal-dual approach is presented, which improves both the convergence and the complexity of the best known auction-like algorithm. It uses the virtual source (VS) concept based on the following consideration: when a node i is visited for the first time by any algorithm which preserves verified the dual admissibility conditions, then the shortest path (SP) from the source node to i is found. Therefore, the SP from the source to the remaining nodes may be computed by considering i as a “virtual source”.We propose a very efficient implementation of an auction-like algorithm that uses this concept and enables us to obtain a computational cost of O(n2), where n is the number of nodes.Numerical experimentsare reported showing that the new method outdoes previously proposed auction-like algorithms and is highly competitive with other state-of-art SP approaches.

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

[2]  Jesper Larsen,et al.  Experiments with the Auction Algorithm for the Shortest Path Problem , 1999, Nord. J. Comput..

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

[4]  D. Bertsekas.  The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .

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

[6]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[7]  R. Leone,et al.  A modified auction algorithm for the shortest path problem , 1994 .

[8]  D. Bertsekas.  A distributed asynchronous relaxation algorithm for the assignment problem , 1985, 1985 24th IEEE Conference on Decision and Control.

[9]  George Luger,et al.  Artificial Intelligence: Structures and Strategies for Complex Problem Solving (5th Edition) , 2004 .

[10]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

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

[12]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[13]  Giancarlo Raiconi,et al.  Graph Collapsing in Shortest Path Auction Algorithms , 2001, Comput. Optim. Appl..

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

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

[16]  Dimitri P. Bertsekas,et al.  A generic auction algorithm for the minimum cost network flow problem , 1993, Comput. Optim. Appl..

[17]  Dimitri P. Bertsekas,et al.  The auction algorithm for the minimum cost network flow problem , 1989 .

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

[19]  D. Bertsekas,et al.  The auction algorithm for the transportation problem , 1989 .