Updating paths in time-varying networks given arc weight changes

Transportation Science

Volumn 39, Issue 4, 2005, Pages 451-464

  Miller Hooks, Elise ^a   Yang, Baiyu ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b AMR   (United States)

Author keywords

Dynamic networks; Intelligent transportation systems; Optimal routing; Reoptimization; Shortest paths; Stochastic networks

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MOTOR TRANSPORTATION; PROBLEM SOLVING; RANDOM PROCESSES; TRAFFIC SURVEYS;

DYNAMIC NETWORKS; OPTIMAL ROUTING; OPTIMAL ROUTING SYSTEMS; REOPTIMIZATION; SHORTEST PATHS; STOCHASTIC NETWORKS;

TIME VARYING NETWORKS;

EID: 28244493703     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1040.0112     Document Type: Article

References (34)

1. Ahuja, R., T. Magnanti, J. Orlin. 1993. Network Flaws. Prentice Hall, Englewood Cliffs, NJ.
2. Bazaraa, M., J. Langley. 1974. A dual shortest path algorithm. SIAM. J. Appl. Math. 26 496-501.
3. Bellman, R. 1958. On a routing problem. Quart. Appl. Math. 16 87-90.
4. Beroggi, G. 1994. A real-time routing model for hazardous materials. Eur. J. Oper. Res. 75 508-520.
5. Bertsekas, D. 1991. An auction algorithm for shortest paths. SIAM J. Optim. 1 425-447.
6. Bertsekas, D., J. Tsitsiklis. 1989. Parallel and Distributed Computation: Numerical Methods. Prentice Hall, Inc., Upper Saddle River, NJ.
7. Bertsekas, D., F. Guerriero, R. Musmanno. 1996. Parallel asynchronous label-correcting methods for shortest paths. J. Optim. Theory Appl. 88 297-320.
8. Catling, I., P. Belcher. 1989. Autoguide-route guidance in the United Kingdom. Proc. 1st Navigation Inform. Systems Conf. (VNIS '89), IEEE, Toronto, Canada, 467-473.
9. Chabini, I. 1998. Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Transportation Res. Record 1645 170-175.
10. Cooke, K., E. Halsey. 1966. The shortest route through a network with time-dependent intermodal transit times. J. Math. Anal. Appl. 14 493-498.
11. Demetrescu, C., G. Italiano. 2001. Fully dynamic all pairs shortest paths with real edge weights. IEEE Sympos. Foundations Comput. Sci., Las Vegas, NV.
12. Dionne, R. 1978. Étude et Extension d'un Algorithme de Murchland. INFOR 16 132-146.
13. Frigioni, D., A. Marchetti-Spaccamela, U. Nanni. 2000. Fully dynamic algorithms for maintaining shortest paths trees. J. Algorithms 34 251-281.
14. Fujishige, S. 1981. A note on the problem of updating shortest paths. Networks 11 317-319.
15. Gallo, G. 1980. Reoptimization procedures in shortest path problems. Rivista di Matematica per le Scienze Economiche e Sociali 3 3-13.
16. Gallo, G., S. Pallottino. 1986. Shortest path methods: A unifying approach. Mattiematical Programming Study, Vol. 26. North-Holland, Amsterdam, The Netherlands, 38-64.
17. Goto, S., A. Sangiovanni-Vincentelli. 1978. A new shortest path updating algorithm. Networks 8 341-372.
18. Miller-Hooks, E., H. Mahmassani. 2000. Least expected time paths in stochastic, time-varying transportation networks. Transportation Sci. 34 198-215.
19. Miller-Hooks, E., S. Stock Patterson. 2004. On solving quickest time problems in time-dependent and dynamic networks. J. Math. Model. Algorithms 3 39-71.
20. Miller-Hooks, E., B. Yang. 2003. Impact of travel time models on quality of real-time routing instructions. Transportation Res. Record 1857 21-29.
21. Murchland, J. 1970. A fixed matrix method for all shortest distances in a directed graph and for the inverse problem. Ph.D. thesis, University of Karlsruhe, Karlsruhe, Germany.
22. Orda, A., R. Rom. 1990. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. Association Comput. Machinery 37 607-625.
23. Pallottino, S. 1984. Shortest-path methods: Complexity, interrelations and new propositions. Networks 14 257-267.
24. Pallottino, S., M. Scutellà. 1997. Dual algorithms for the shortest path tree problem. Networks 29 125-133.
25. Pallottino, S., M. Scutellà. 1998. Shortest path algorithms in transportation models: Classical and innovative aspects. P.Marcotte, S. Nguyen, eds. Equilibrium and Advanced Transportation Modeling. Kluwer Academic Publishers, Boston, MA, 245-281.
26. Pallottino, S., M. Scutellà. 2003. A new algorithm for reoptimizing shortest paths when the arc costs change. Oper. Res. Lett. 31 149-160.
27. Pape, U. 1974. Implementation and efficiency of Moore-algorithms for the shortest route problem. Math. Programming 7 212-222.
28. Ramalingam, G., T. Reps. 1996. An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21 267-305.
29. Rodionov, V. 1968. The parametric problem of shortest distances. U.S.S.R. Computational Math. Math. Phys. 8 336-343.
30. Sparmann, J. 1989. LISB route guidance and information system: First results of the field trial. Proc. 1st Navigation Inform. Systems Conf. (VNIS '89), IEEE, Toronto, Canada, 463-166.
31. Yang, B. 2001. Robust on-line routing in intelligent transportation systems. Ph.D. thesis, Pennsylvania State University, University Park, PA.
32. Yang, B., E. Miller-Hooks. 2004. Adaptive routing considering delays due to signal operations. Transportation Res. B 38 385-413.
33. Ziliaskopoulos, A. 1994. Optimum path algorithms on multidimensional networks: Analysis and design, implementation and computational experience. Ph.D. thesis, University of Texas, Austin, TX.
34. Ziliaskopoulos, A., H. Mahmassani. 1993. Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications. Transportation Res. Record 1408 94-100.