A new algorithm for reoptimizing shortest paths when the arc costs change

We propose the first algorithmic approach which reoptimizes the shortest paths when any subset of arcs of the input graph is affected by a change of the costs, which can be either lower or higher than the old ones. This situation is more general than the ones addressed in the literature so far. We analyze the worst-case time complexity of the algorithm as a function of both the input size and the overall cost perturbation, and discuss cases for which the proposed reoptimization method theoretically outperforms the approach of applying a standard shortest path algorithm after the change of the arc costs.

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

[2]  Sang Nguyen,et al.  A dual simplex algorithm for finding all shortest paths , 1981, Networks.

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

[4]  G. Nemhauser.  A generalized permanent label setting algorithm for the shortest path between specified nodes , 1972 .

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

[6]  Maria Grazia Scutellà,et al.  Dual Algorithms for the Shortest Path Tree Problem , 1996 .

[7]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[8]  Alberto L. Sangiovanni-Vincentelli,et al.  A new shortest path updating algorithm , 1978, Networks.

[9]  Maria Grazia Scutellà,et al.  A new dual algorithm for shortest path reoptimization , 1999 .

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

[11]  René Dionne.  Etude Et Extension D’Un Algorithme De Murghland , 1978 .

[12]  A. Goldberg,et al.  Implementations of Dijkstra’s Algorithm Based on Multi-Level Buckets , 1997 .

[13]  Giorgio Gallo,et al.  Reoptimization procedures in shortest path problem , 1980 .

[14]  L FoxBennett,et al.  Shortest-Route Methods , 1979 .

[15]  John David Murchland,et al.  A fixed matrix method for all shortest distances in a directed graph and for the inverse problem , 1970 .

[16]  Giorgio Gallo,et al.  A new algorithm to find the shortest paths between all pairs of nodes , 1982, Discret. Appl. Math..

[17]  Satoru Fujishige.  A note on the problem of updating shortest paths , 1981, Networks.

[18]  Giorgio Gallo,et al.  Shortest path algorithms , 1988, Handbook of Optimization in Telecommunications.