A heuristic search approach for a nonstationary stochastic shortest path problem with terminal cost

Transportation Science

Volumn 36, Issue 2, 2002, Pages 218-230

  Bander, James L ^a   White III, Chelsea C ^a  

^a NORFOLK SOUTHERN CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; HEURISTIC PROGRAMMING; RANDOM PROCESSES; TIME MEASUREMENT;

TRANSPORTATION NETWORKS;

TRUCK TRANSPORTATION;

EID: 0036567469     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.36.2.218.562     Document Type: Article

References (24)

1. Three approaches to heuristic search in networks
2. An analysis of stochastic shortest path problems
3. Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time
4. Admissibility of AO* when heuristics overestimate
5. An admissible and optimal algorithm for searching AND/OR graphs
6. Path preferences and optimal paths in probabilistic networks
7. Shortest paths in probabilistic graphs
8. The shortest path problem for graphs with random arc lengths
9. Shortest paths with Euclidean distances: An explanatory model
10. The fastest path through a network with random time-dependent travel times
11. Fastest paths in time-dependent networks for intelligent vehicle highway systems application
12. Optimal paths in graphs with stochastic or multidimensional weights
13. A modified dynamic programming method for Markov decision problems
14. Additive AND/OR graphs
15. Optimizing decision trees through heuristically guided search
16. Optimal paths in probabilistic networks: A case with temporary preferences
17. Minimum wait paths in time-dependent networks