Optimal routing policy problems stochastic time-dependent networks part I: Framework and taxonomy

IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

Volumn 2002-January, Issue , 2002, Pages 549-554

  Gao, Song ^a   Chabini, Ismail ^a  

^a NONE

Author keywords

Information; Network optimization; Routing policy; Stochastic time dependent network

Indexed keywords

COSTS; INTELLIGENT SYSTEMS; INTELLIGENT VEHICLE HIGHWAY SYSTEMS; OPTIMIZATION; STOCHASTIC SYSTEMS; TAXONOMIES; TRAFFIC CONTROL; TRANSPORTATION; TRAVEL TIME;

DYNAMIC TRAFFIC ASSIGNMENTS; INFORMATION; NETWORK OPTIMIZATION; NETWORK OPTIMIZATION PROBLEM; ROUTING POLICIES; STOCHASTIC AND TIME-DEPENDENT NETWORKS; STOCHASTIC TIME DEPENDENT NETWORKS; TELECOMMUNICATION APPLICATIONS;

NETWORK ROUTING;

EID: 84949230586     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITSC.2002.1041277     Document Type: Conference Paper

References (16)

1. J. A. Bottom, Anticipatory Consistent Route Guidance, Ph.D. thesis, Massachusetts Institute of Technology, Sept. 2000.
2. S. Clao and J, Chabini, "Optimal routing policy problems in ' stochastic time-dependent networks, " Submitted for publication in transportation Reserch Part B, 2001.
3. S. Gao and I Chabini, "Optimal routing policy problems in stochastic time-dependent networks part ii: Exact and approximation algorithms, " Accepted for publication in Proceedings of the IEER 5th International Conference on Intelligent TYans- portation Systems, 2002.
4. G. Andrentta and I., Romeo, "Stochastic shortest paths with recourse, " Networks, vol. 18, pp. 193-204, 1988.
5. G. Polychrcmopoulos and J. N. Tsitsiklis, "Stochastic shortest path problems with recourse, " Networks, vol. 27, pp. 133-143, 1996.
6. R. K. Cheung, "Iterative methods for dynamic stochastic shortest path problems, " Navel Reserch Logistics, vol. 46, pp. 789- 789, 1998.
7. R.W. Hall, "The fastest path through a network with random time-dependent travel times, " Trans-portaiion Science vol. 20, no. 3, pp. 91-101, 1986.
8. I.Chabini, "Algorithms for k-shortest paths and other optimal routing problems in time-dependent stochastic networks, " accepted for publication in Transportation Research Part B, 2000.
9. E. D. Miller-Hooks and H. S. Mahmassani, Least expected time paths in stochastic, time-varying transportation networks, " Transportation Science, vol. 34, no. 2, pp. 198 -215. 2000.
10. E.D. Miller-Hooks, "Adaptive least-expected time paths in stochastic, time-varying transportation and data networks, " Networks, vol. 37, no. 1, pp. 35-52, 2001.
11. L. Fu, "An adaptive routing algorithm for in-vehicle route guidance systems with real-time information, " Transportation Research Part B vol. 35, pp. 740-765, 2001.
12. G. Polychronopoulos, Stochastic and Dynamic Shortest Distance Problems, Ph.D. thesis, Massachusetts Institute of Technology, May.
13. H. N. Psaraftis and J. N. Tsitsiklis, "Dynamic shortest paths in acyclic networks with markovian arc costs, " Operations Research, vol. 41, no. 1, pp. 91-101, 1993.
14. S. Gao, "Routing problems in stochastic time-dependent networks with applications in dynamic traffic assignment, " M.S. thesis, Massachusetts Institute of Technology, Feb. 2002.
15. I. Chabini, "Discrete dynamic shortest path problems ir> transportation applications: Complexity and algorithms with optimal run time, " Transportation Research Record, vol. 1645, pp. 170- 175, 1999.
16. J. Croucher, "A noto on tho stochastic shortest-route problem, " Naval Research Logistics Quarterly, vol. 25, pp 729-732, 1978.