Dynamic Shortest Paths Minimizing Travel Times and Costs

Networks

Volumn 41, Issue 4, 2003, Pages 197-205

  Ahuja, Ravindra K ^a   Orlin, James B ^b   Pallottino, Stefano ^c   Scutellà, Maria G ^c  

^a UNIVERSITY OF FLORIDA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

Dynamic shortest path problem; Shortest path problem; Traffic network; Transportation network

Indexed keywords

DYNAMIC SHORTEST PATH PROBLEM; SHORTEST PATH PROBLEM; TRAFFIC NETWORK; TRANSPORTATION NETWORK;

ALGORITHMS; COSTS; FUNCTIONS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; THEOREM PROVING;

TELECOMMUNICATION NETWORKS;

EID: 2142664491     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10072     Document Type: Article

References (14)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms, and applications, Prentice Hall, Englewood Cliffs, NJ, 1993.
2. R.K. Ahuja, J.B. Orlin, S. Pallottino, and M.G. Scutellà, Minimum time and minimum cost path problems in street networks with periodic traffic lights, Trans Sci 36 (2002), 326-336.
3. th IFAC Symp on Transport Systems, Chania, Greece, June 16-17, 1997, pp. 551-556.
4. I. Chabini, Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time, Trans Res Rec 1645 (1998), 170-175.
5. S.E. Dreyfus, An appraisal of some shortest-path algorithms, Oper Res 17 (1969), 395-412.
6. M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J ACM 34 (1987), 596-615.
7. D.E. Kaufman and R.L. Smith, Fastest paths in time-dependent networks for intelligent vehicle-highway systems application, IVHS J 1 (1993), 1-11.
8. R.F. Kirby and R.B. Potts, The minimum route problem for networks with turn penalties and prohibitions, Trans Res 3 (1969), 397-408.
9. A. Orda and R. Rom, Shortest-path and minimum-delay algorithms in networks with time-dependent edge length, J ACM 37 (1990), 607-625.
10. A. Orda and R. Rom, Minimum weight paths in time-dependent networks, Networks 21 (1991), 295-320.
11. S. Pallottino and M.G. Scutellà, "Shortest path algorithms in transportation models: Classical and innovative aspects," Equilibrium and advanced transportation modelling, P. Marcotte and S. Nguyen (Editors), Kluwer, Norwell, MA, 1998, pp. 245-281.
12. W.W. Wardell and A.K. Ziliaskopoulos, A intermodal optimum path algorithm for dynamic multimodal networks, Eur J Oper Res 125 (2000), 486-502.
13. A.K. Ziliaskopoulos, Optimum path algorithms on multidimensional networks: Analysis, design, implementation and computational experience, Ph.D. Dissertation, University of Texas at Austin, 1994.
14. A.K. Ziliaskopoulos and H.S. Mahmassani, On finding least time paths considering delays for intersection movements, Trans Res B 30 (1996), 359-367.