Least expected time hyperpaths in stochastic, time-varying multimodal networks

Transportation Research Record

Volumn , Issue 1771, 2001, Pages 89-96

  Opasanon, Sathaporn ^a   Miller Hooks, Elise ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; RANDOM PROCESSES; TIME VARYING NETWORKS; TRAFFIC CONTROL;

TIME VARYING MULTIMODAL NETWORKS;

TRANSPORTATION;

EID: 0035731749     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1771-12     Document Type: Conference Paper

References (17)

1. The shortest route through a network with time-dependent internodal transit times
2. An appraisal of some shortest-path algorithms
3. Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications
4. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
5. Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time
6. The fastest path through a network with random time-dependent travel times
7. Dynamic shortest paths in acyclic networks with Markovian arc costs
8. Least possible time paths in stochastic, time-varying networks
9. Optimal routing of hazardous materials in stochastic, time-varying transportation networks
10. Least expected time paths in stochastic, time-varying transportation networks
11. Least-expected time paths with recourse in stochastic, time-varying transportation and data networks
12. Optimal strategies: A new assignment model for transit networks
13. Transit service and path choice models in stochastic and time-dependent networks
14. A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
15. Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem
16. Intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays