The dynamic shortest path problem with anticipation

European Journal of Operational Research

Volumn 176, Issue 2, 2007, Pages 836-854

  Thomas, Barrett W ^a   White III, Chelsea C ^b  

^a UNIVERSITY OF IOWA   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Markov decision processes; Real time decision making; Routing

Indexed keywords

COMMUNICATION CAPABILITY; OPTIMAL ANTICIPATORY POLICY; REAL TIME DECISION MAKING; ROUTING;

DECISION MAKING; FUNCTION EVALUATION; MARKOV PROCESSES; MOBILE TELECOMMUNICATION SYSTEMS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; REAL TIME SYSTEMS; TRAFFIC CONTROL; TRUCK DRIVERS;

OPERATIONS RESEARCH;

EID: 33749544788     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.09.019     Document Type: Article

References (31)

1. Huggins E.L., and Olsen T.L. Supply chain management with guaranteed deliveries. Management Science 49 (2003) 1154-1167
2. B.W. Thomas, Anticipatory route selection problems, Ph.D. thesis, University of Michigan, 2002.
3. Hall R.W. The fastest path through a network with random time-dependent travel times. Transportation Science 20 (1986) 182-188
4. Bander J.L., and White III C.C. A heuristic search approach for a nonstationary shortest path problem with terminal costs. Transportation Science 36 (2002) 218-230
5. Fu L., and Rilett L.R. Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research B 32 (1998) 499-516
6. Miller-Hooks E.D., and Mahmassani H.S. Least possible time paths in stochastic, time-varying transportation networks. Computers & Operations Research 25 (1998) 1107-1125
7. Miller-Hooks E.D., and Mahmassani H.S. Least expected time paths in stochastic, time-varying transportation networks. Transportation Science 34 (2000) 198-215
8. Chabini I. Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Transportation Research Record 1645 (1998) 170-175
9. Polychronopoulos G.H., and Tsitsiklis J.N. Stochastic shortest path problems with recourse. Networks 27 (1996) 133-143
10. Cheung R.K. Iterative methods for dynamic stochastic shortest path problems. Naval Research Logistics 45 (1998) 769-789
11. Cheung R.K., and Muralidharan B. Dynamic routing for priority shipments in LTL service networks. Transportation Science 34 (2000) 86-98
12. Psaraftis H.N., and Tsitsiklis J.N. Dynamic shortest paths in acyclic networks with Markovian arc costs. Operations Research 41 (1993) 91-101
13. Davies C., and Lingras P. Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks. European Journal of Operational Research 144 (2003) 27-38
14. Waller S.T., and Ziliaskopoulos A.K. On the online shortest path problem with limited arc cost dependencies. Networks 40 (2002) 216-227
15. Kim S., Lewis M.E., and White III C.C. Optimal vehicle routing with real-time traffic information. IEEE Transactions on Intelligent Transportation Systems 6 2 (2005) 178-188
16. Kim S., Lewis M.E., and White III C.C. State space reduction for non-stationary stochastic shortest path problems with real-time traffic congestion information. IEEE Transactions on Intelligent Transportation Systems 6 3 (2005) 273-284
17. Azaron A., and Kianfar F. Dynamic shortest path in stochastic dynamic networks: Ship routing problem. European Journal of Operational Research 144 (2003) 138-156
18. Ferris M.C., and Ruszczyński A. Robust path choice in networks with failures. Networks 35 (2000) 181-194
19. Bertsekas D.P. Dynamic Programming and Optimal Control vol. 2 (1995), Athena Scientific, Belmont, MA
20. Powell W.B., Sheffi Y., Nickerson K.S., Butterbaugh K., and Atherton S. Maximizing profits for north american van lines' truckload division: A new framework for pricing and operations. Interfaces 18 (1988) 21-41
21. Powell W.B. A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transportation Science 30 (1996) 195-219
22. M. Datar, A. Ranade, Commuting with delay prone buses, in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 22-29.
23. J. Boyan, M. Mitzenmacher, Improved results for route planning in stochastic transportation networks, in: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001, pp. 895-902.
24. Thomas B.W., and White III C.C. Anticipatory route selection. Transportation Science 38 (2004) 473-487
25. Bracquemond C., Gaudoin O., Roy D., and Xie M. On some discrete notions of aging. In: Hayakawa Y., Irony T., Xie M., and Barlow R. (Eds). System and Bayesian Reliability: Essays in Honor of Professor Richard E. Barlow (2001), World Scientific Publishing Company, Singapore (Chapter 11)
26. Barlow R.E., and Proschan F. Statistical Theory of Reliability and Life Testing: Probability Models (1975), Holt, Rinehart, and Winston, Inc., New York
27. Ross S.M. Stochastic Processes (1996), John Wiley and Sons, Inc., New York
28. Puterman M.L. Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994), John Wiley and Sons, Inc., New York
29. Eiger A.P., Mirchandani P.B., and Soroush H. Path preferences and optimal paths in probabilistic networks. Transportation Science 19 (1985) 75-84
30. Powell W.B., Jaillet P., and Odoni A. Stochastic and dynamic networks and routing. Handbook in OR and MS (1995), North-Holland, Amsterdam 141-295
31. Psaraftis H.N. Dynamic vehicle routing: Status and prospects. Annals of Operations Research 61 (1995) 143-164