State space reduction for nonstationary stochastic shortest path problems with real-time traffic information

IEEE Transactions on Intelligent Transportation Systems

Volumn 6, Issue 3, 2005, Pages 273-284

  Kim, Seongmoon ^a,b   Lewis, Mark E ^c   White, Chelsea C ^a,d,e,f,g,h  

^a IEEE   (South Korea)

^b Department of Innovation and Entrepreneurial Marketing   (South Korea)

^c UNIVERSITY OF MICHIGAN   (United States)

^d Georgia Institute of Technology   (United States)

^e GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^f Trucking Industry Program (TIP)   (United States)

^g Logistics Institute   (United States)

^h INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Dynamic programming; Markov decision process; Nonstationary stochastic shortest path problem; Real time traffic information; State space reduction; Vehicle routing

Indexed keywords

MARKOV DECISION PROCESS (MDP); REAL-TIME TRAFFIC INFORMATION; ROUTING VEHICLES; STATE SPACE REDUCTION; VEHICLE ROUTING;

DECISION MAKING; DYNAMIC PROGRAMMING; INFORMATION RETRIEVAL; MANAGEMENT INFORMATION SYSTEMS; RANDOM PROCESSES; ROUTERS; STATE SPACE METHODS; TRAFFIC CONTROL;

REAL TIME SYSTEMS;

EID: 21644443677     PISSN: 15249050     EISSN: None     Source Type: Journal    
DOI: 10.1109/TITS.2005.853695     Document Type: Article

References (24)

1. G. H. Polychronopoulos and J. N. Tsitsiklis, "Stochastic shortest path problems with recourse," Networks, vol. 27, no. 2, pp. 133-143, 1996.
2. R. Hall, "The fastest path through a network with random time-dependent travel times," Transp. Sci., vol. 20, no. 3, pp. 182-188, 1986.
3. J. Pearl, Heuristics: Intelligent Search Strategy for Computer Problem Solving. Reading, MA: Addison-Wesley, 1984.
4. J. L. Bander and C. C. White, III, "A Heuristic search algorithm for path determination with learning," IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 28, no. 1, pp. 131-134, 1998.
5. I. Chabini, "Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks." IEEE Trans. Intell. Transp. Syst., vol. 3, no. 1, pp. 60-74, 2002.
6. J. L. Bander and C. C. White, III, "A Heuristic search approach for a non-stationary stochastic shortest path problem with terminal cost," Transp. Sci., vol. 36, no. 2, pp. 218-230, 2002.
7. G. R. Jagadeesh, T. Srikanthan, and K. H. Quek, "Heuristic techniques for accelerating hierarchical routing on road networks," IEEE Trans. Intell. Transp. Syst., vol. 3, no. 4, pp. 301-309, 2002.
8. E. D. Miller-Hooks and H. S. Mahmassani, "Least possible time paths in stochastic, time-varying transportation networks," Comput. Oper. Res., vol. 25, no. 12, pp. 1107-1125, 1998.
9. _, "Least expected time paths in stochastic, time-varying transportation networks," Transp. Sci., vol. 34, no. 2, pp. 198-215, 2000.
10. J. S. Croucher, "A note on the stochastic shortest-route problem," Nav. Res. Logist. Q., vol. 25, pp. 729-732, 1978.
11. G. Andreatta and L. Romeo, "Stochastic shortest paths with recourse," Networks, vol. 18, no. 3, pp. 193-204, 1988.
12. S. T. Waller and A. K. Ziliaskopoulos, "On the online shortest path problem with limited arc cost dependencies," Networks, vol. 40, no. 4, pp. 216-227, 2002.
13. I. Chabini, "Discrete dynamic shortest path problems in transportation applications," Transp. Res. Rec., vol. 1645, pp. 170-175, 1998.
14. I. Chabini and S. Ganugapati, "Design and implementation of parallel dynamic shortest path algorithms for intelligent transportation systems applications," Transp. Res. Rec., vol. 1771, pp. 219-228, 2001.
15. S. Gao and I. Chabini, "Best routing policy problem in stochastic time-dependent networks," Transp. Res. Rec., vol. 1783, pp. 188-196, 2002.
16. H. N. Psaraftis and J. N. Tsitsiklis, "Dynamic shortest path in acyclic network with Markovian arc costs," Oper. Res., vol. 41, no. 1, pp. 91-101, 1993.
17. L. Fu and L. R. Rilett, "Expected shortest paths in dynamic and stochastic traffic networks," Transp. Res., Part B, vol. 32, no. 7, pp. 499-516, 1998.
18. L. Fu, "An adaptive routing algorithm for in vehicle route guidance systems with real-time information," Transp. Res., Part B, vol. 35, no. 8, pp.749-765, 2001.
19. B. Thomas, "Anticipatory route selection problems," Ph.D. thesis, Ind. Operations Eng. Dept., Univ. Michigan, Ann Arbor, MI, 2002.
20. S. Kim, M. E. Lewis, and C. C. White, III, "Optimal vehicle routing with real-time traffic information," IEEE Trans. Intell. Transp. Syst., vol. 6, no. 2, pp. 178-188, 2005.
21. S. M. Ross, Stochastic Processes. New York: Wiley, 1996.
22. M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming. New York: Wiley, 1994.
23. S. Kim, "Optimal vehicle routing and scheduling with real-time traffic information," Ph.D. thesis, Dept. Ind. Syst. Eng., Univ. Michigan, Ann Arbor, MI, 2003.
24. V. G. Kulkarni, Modeling and Analysis of Stochastic Systems. London, U.K.: Chapman & Hall, 1995.