Best routing policy problem in stochastic time-dependent networks

Transportation Research Record

Volumn , Issue 1783, 2002, Pages 188-196

  Gao, Song ^a   Chabini, Ismail ^a  

^a Massachusetts Institute of Technology Cambridge   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; STOCHASTIC CONTROL SYSTEMS;

STOCHASTIC TIME-DEPENDENT NETWORKS;

TRANSPORTATION;

EID: 0036949228     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1783-23     Document Type: Article

References (15)

1. Bottom, J. A. Consistent Anticipatory Route Guidance. Ph.D. dissertation. Massachusetts Institute of Technology, Cambridge, 2000.
2. Andreatta, G., and L. Romeo. Stochastic Shortest Paths with Recourse. Networks, Vol. 18, 1988, pp. 193-204.
3. Polychronopoulos, G. H., and J. N. Tsitsiklis. Stochastic Shortest Path Problems with Recourse. Networks, Vol. 27, 1996, pp. 133-143.
4. Cheung, R. K. Iterative Methods for Dynamic Stochastic Shortest Path Problems. Naval Research Logistics, Vol. 45, 1998, pp. 769-789.
5. Polychronopoulos, G. H. Stochastic Dynamic Shortest Distance Problems. Ph.D. dissertation. Massachusetts Institute of Technology, Cambridge, 1992.
6. Psaraftis, H. N., and J. N. Tsitsiklis. Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs. Operations Research, Vol. 41, No. 1, 1993, pp. 91-101.
7. Hall, R. W. The Fastest Path Through a Network with Random Time-Dependent Travel Times. Transportation Science, Vol. 20, No. 3, 1986, pp. 182-188.
8. Chabini, I. Minimum Expected Travel Times in Stochastic Time-Dependent Networks Revisited. Transportation Research B, 2002 (in press).
9. Miller-Hooks, E. D., and H. S. Mahmassani. Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks. Transportation Science, Vol. 34, No. 2, 2000, pp. 198-215.
10. Miller-Hooks, E. D. Adaptive Least-Expected Time Paths in Stochastic, Time-Varying Transportation and Data Networks. Networks, Vol. 37, No. 1, 2001, pp. 35-52.
11. Gao, S., and I. Chabini. Optimal Routing Policy Problems in Stochastic Time-Dependent Networks. Transportation Research B, 2002 (submitted).
12. Chabini, I. Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time. In Transportation Research Record 1645, TRB, National Research Council, Washington, D.C., 1998, pp. 170-175.
13. Gao, S. Routing Problems in Stochastic Time-Dependent Networks with Applications in Dynamic Traffic Assignment. Master'S thesis. Massachusetts Institute of Technology, Cambridge, 2002.
14. Bertsekas, B. P. Dynamic Programming and Optimal Control. Athena Scientific, Belmont, Mass., 1995.
15. Gao, S., and I. Chabini. Policy-Based Stochastic Dynamic Traffic Assignment Models and Algorithms. IEEE 5th International Conference on Intelligent Transportation Systems, 2002 (submitted).