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

Operations Research Letters

Volumn 31, Issue 2, 2003, Pages 149-160

  Pallottino, Stefano ^a   Scutellà, Maria Grazia ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Flow algorithms; Reoptimization; Shortest paths

Indexed keywords

ALGORITHMS; OPERATIONS RESEARCH; OPTIMIZATION; PERTURBATION TECHNIQUES; TREES (MATHEMATICS);

REOPTIMIZATION; SHORTEST PATH PROBLEMS;

PROBLEM SOLVING;

EID: 0037362479     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00192-X     Document Type: Article

References (18)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows: Theory, Algorithms, and Applications. 1993;Prentice-Hall, Englewood Cliffs, NJ.
2. Denardo E.V., Fox B.L. Shortest-route methods. 1. reaching, pruning, and buckets Oper. Res. 27:1979;161-186.
3. Dial R. Algorithm 360. shortest path forest with topological ordering Commun. ACM. 12:1969;632-633.
4. Dijkstra E.W. A note on two problems in connexion with graphs. Numer. Math. 1:1959;269-271.
5. Dionne R. Étude et extension d'un algorithme de Murchland. INFOR. 16:1978;132-146.
6. Florian M., Nguyen S., Pallottino S. A dual simplex algorithm for finding all shortest paths. Networks. 11:1981;367-378.
7. Fredman M.L., Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM. 34:1987;596-615.
8. Fujishige S. A note on the problem of updating shortest paths. Networks. 11:1981;317-319.
9. Gallo G. Reoptimization procedures in shortest path problems. Riv. Mat. Sci. Econom. Social. 3:1980;3-13.
10. Gallo G., Pallottino S. A new algorithm to find the shortest paths between all pairs of nodes. Discrete Appl. Math. 4:1982;23-35.
11. Gallo G., Pallottino S. Shortest path algorithms. Ann. Oper. Res. 13:1988;3-79.
12. A.V. Goldberg, C. Silverstein, Implementations of Dijkstra's algorithm based on multi-level buckets, in: P.M. Pardalos, D.W. Hearn, W.W. Hages (Eds.), Lecture Notes in Economics and Mathematical Systems, Vol. 450, Springer, Berlin, 1997, pp. 292-327.
13. Goto S., Sangiovanni-Vincentelli A. A new shortest path updating algorithm. Networks. 8:1978;341-372.
14. Lawler E.L. Combinatorial Optimization: Networks and Matroids. 1976;Holt, Rinehart and Winston, New York.
15. J.D. Murchland, A fixed matrix method for all shortest distances in a directed graph and for the inverse problem, Ph.D. Thesis, University of Karlsruhe, 1970.
16. Nemhauser G. A generalized permanent label setting algorithm for the shortest path between specified nodes. J. Math. Anal. Appl. 38:1972;328-334.
17. S. Nguyen, S. Pallottino, M.G. Scutellà, A new dual algorithm for shortest path reoptimization, in: M. Gendreau, P. Marcotte (Eds.), Transportation and Network Analysis - Current Trends, Kluwer, Dordrecht, 2002, pp. 221-235.
18. Pallottino S., Scutellà M.G. Dual algorithms for the shortest path tree problem. Networks. 29:1997;125-133.