A relaxation-based pruning technique for a class of stochastic shortest path problems

Transportation Science

Volumn 30, Issue 3, 1996, Pages 220-236

  Murthy, Ishwar ^a   Sarkar, Sumit ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION MAKING; MOTION PLANNING; OPTIMIZATION; RANDOM PROCESSES; SCHEMATIC DIAGRAMS; TERMINOLOGY;

OPTIMAL PATH; PRUNING TECHNIQUE; STOCHASTIC SHORTEST PATH PROBLEMS;

TRANSPORTATION ROUTES;

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

References (21)

1. ADLAKHA, V. G., "An Improved Conditional Monte Carlo Technique for Stochastic Shortest Route Problem," Management Science 32, 1360-1367 (1986).
2. BARD, J. F. AND J. E. BENNETT, "Arc Reduction and Path Preference in Stochastic Acyclic Networks," Management Science 37, 198-215 (1991).
3. DENARDO, E. V., Dynamic Programming: Models and Applications, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1982.
4. DEO, N. AND C. Y. PANG, "Shortest Path Problems: Taxonomy and Annotation," Networks 14, 275-323 (1984).
5. DIAL, R., F. GLOVER, D. KARNEY AND D. KLINGMAN, "A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees," Networks 9, 215-248 (1979).
6. FRANK, H., "Shortest Paths in Probabilistic Graphs," Operations Research 17, 583-599 (1969).
7. GLOVER, F., D. KLINGMAN, N. V. PHILLIPS AND R. F. SCHNEIDER, "New Polynomial Shortest Path Algorithms and their Computational Attributes," Management Science 31, 1106-1128 (1985).
8. HANSEN, P., "Bicriterion Path Problems," in G. Fandel and T. Gal (eds.), Multiple Criteria Decision Making: Theory and Applications, Springer, Heidelberg, 109-127, 1980.
9. HENIG, M. I., "The Shortest Path Problem with two Objectives," European Journal of Operational Research 25, 281-291 (1985).
10. HENIG, M. I., "Risk Criteria in a Stochastic Knapsack Problem," Operations Research 38, 820-825 (1990).
11. ISHII, H., S. SHIODE, T. NISHTIDA AND Y. NAMASUYA, "Stochastic Spanning Tree Problem," Discrete Applied Mathematics 3, 263-273 (1981).
12. KAMBUROWSKI, J., "A Note on the Stochastic Shortest Route Problem," Operations Research 33, 696-698 (1985).
13. KEENEY, R. L. AND H. RAIFFA, Decisions with Multiple Objectives: Preferences and Value Tradeoffs, John Wiley, New York, 1976.
14. LOUI, R. P., "Optimal Paths in Graphs with Stochastic or Multidimensional Weights," Communications of the ACM 26, 670-676 (1983).
15. LUENBERGER, D. G., Linear and Nonlinear Programming, Addison-Wesley Publishing Co., Reading, Mass. 1989.
16. MIRCHANDANI, P. B. AND H. SOROUSH, "Optimal Paths in Probabilistic Networks: A Case with Temporary Preferences," Computers and Operations Research 12, 365-383 (1985).
17. MOTE, J., I. MURTHY AND D. L. OLSON, "A Parametric Approach to Solving Bicriterion Shortest Path Problems," European Journal of Operational Research 53, 81-92 (1991).
18. MURTY, K. G., Linear Programming, John Wiley, New York, 1983.
19. PALLOTTINO, S., "Shortest-Path Methods: Complexity, Interrelations and New Propositions," Networks 14, 257-267 (1984).
20. SIGAL, C. E., A. A. B. PRITSKER AND J. J. SOLBERG, "The Stochastic Shortest Route Problem," Operations Research 28, 1122-1129 (1980).
21. WARBURTON, A., "Approximation of Pareto-optima in Multiple-objective, Shortest Path Problems," Operations Research 35, 70-79 (1987).