STOCHASTIC SHORTEST PATH PROBLEMS WITH RECOURSE 1

We consider shortest path problems defined on graphs with random arc costs. We assume that information on arc cost values is accumulated as the graph is being traversed. The objective is to devise a policy that leads from an origin to a destination node with minimal expected cost. We provide dynamic programming algorithms, estimates for their complexity, negative complexity results, and analysis of some possible heuristic algorithms.

[1]  John N. Tsitsiklis,et al.  Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs , 1993, Oper. Res..

[2]  George H. Polychronopoulos.  Stochastic and dynamic shortest distance problems , 1992 .

[3]  John N. Tsitsiklis,et al.  An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..

[4]  Baruch Schieber,et al.  The Canadian Traveller Problem , 1991, SODA '91.

[5]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[6]  Giovanni Andreatta,et al.  Stochastic shortest paths with recourse , 1988, Networks.

[7]  John N. Tsitsiklis,et al.  The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..

[8]  Dimitri P. Bertsekas,et al.  Dynamic Programming: Deterministic and Stochastic Models , 1987 .

[9]  Refael Hassin,et al.  On Shortest Paths in Graphs with Random Weights , 1985, Math. Oper. Res..

[10]  Hossein Soroush,et al.  Optimal paths in probabilistic networks: A case with temporary preferences , 1985, Comput. Oper. Res..

[11]  Christos H. Papadimitriou,et al.  Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[12]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[13]  J. Croucher.  A note on the stochastic shortest‐route problem , 1978 .

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Pitu B. Mirchandani,et al.  Shortest distance and reliability of probabilistic networks , 1976, Comput. Oper. Res..

[16]  H. Frank,et al.  Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..