Impact of Travel Time Models on Quality of Real-Time Routing Instructions

Transportation Research Record

Volumn , Issue 1857, 2003, Pages 21-29

  Miller Hooks, Elise ^a   Yang, Baiyu ^b  

^a The Pennsylvania State University   (United States)

^b AMR   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); DECISION MAKING; KNOWLEDGE ACQUISITION; MATHEMATICAL MODELS; MOBILE TELECOMMUNICATION SYSTEMS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; REAL TIME SYSTEMS; ROBUSTNESS (CONTROL SYSTEMS); SET THEORY; TIME VARYING NETWORKS;

CONGESTION TRANSPORTATION SYSTEMS; PROBABILITY MASS FUNCTIONS (PMFS); REAL-TIME ROUTING INSTRUCTIONS; TRAVEL TIME MODELS;

INTELLIGENT VEHICLE HIGHWAY SYSTEMS;

EID: 2142647884     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1857-03     Document Type: Conference Paper

References (16)

1. Hall, R. The Fastest Path Through a Network with Random Time-Dependent Travel Times. Transportation Science, Vol. 20, 1986, pp. 182-188.
2. Psaraftis, H., and J. Tsitsiklis. Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs. Operations Research, Vol. 41, 1993, pp. 91-101.
3. Miller-Hooks, E., and H. S. Mahmassani. Least Possible Time Paths in Stochastic, Time-Varying Networks. Computers and Operations Research, Vol. 25, 1998, pp. 1107-1125.
4. Miller-Hooks, E., and H. S. Mahmassani. Optimal Routing of Hazardous Materials in Stochastic, Time-Varying Transportation Networks. In Transportation Research Record 1645, TRB, National Research Council, Washington, D.C., 1998, pp. 143-151.
5. Miller-Hooks, E., and H. S. Mahmassani. Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks. Transportation Science, Vol. 34, 2000, pp. 198-215.
6. Fu, L., and L. Rilett. Expected Shortest Paths in Dynamic and Stochastic Traffic Networks. Transportation Research B, Vol. 32, 1998, pp. 499-516.
7. Pretolani, D. A Directed Hyperpath Model for Random Time Dependent Shortest Paths. European Journal of Operational Research, Vol. 123, 2000, pp. 315-324.
8. Fu, L. An Adaptive Routing Algorithm for In-Vehicle Route Guidance Systems with Real-Time Information. Transportation Research B, Vol. 35, 2001, pp. 749-765.
9. Miller-Hooks, E. Adaptive Least-Expected Time Paths in Stochastic, Time-Varying Transportation and Data Network. Networks, Vol. 37, 2001, pp. 35-52.
10. Yang, B. Robust On-Line Routing in Intelligent Transportation Systems. Ph.D. dissertation. Department of Civil and Environmental Engineering, The Pennsylvania State University, University Park, 2001.
11. Koutsopoulos, H., and H. Xu. An Information Discounting Routing Strategy for Advanced Traveler Information Systems. Transportation Research C, Vol. 1, 1993, pp. 249-264.
12. Ahuja, R., Magnanti, T., and J. Orlin. Network Flows. Prentice Hall, Englewood Cliffs, N.J., 1993, ch. 4, 5.
13. Bellman, R. On a Routing Problem. Quarterly of Applied Mathematics, Vol. 16, 1958, pp. 87-90.
14. Ziliaskopoulos, A. K., and H. S. Mahmassani. Time-Dependent, Shortest-Path Algorithm for Real-Time Intelligent Vehicle Highway System Applications. In Transportation Research Record 1408, TRB, National Research Council, Washington, D.C., 1993, pp. 94-100.
15. 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.
16. Miller-Hooks, E., and B. Yang. Updating Paths in General Transportation Networks. Transportation Science, 2002, in review.