Dynamic shortest path in stochastic dynamic networks: Ship routing problem

European Journal of Operational Research

Volumn 144, Issue 1, 2003, Pages 138-156

  Azaron, Amir ^a   Kianfar, Farhad ^b  

^a BU ALI SINA UNIVERSITY   (Iran)

^b SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Dynamic programming; Markov processes; Stochastic processes

Indexed keywords

ALGORITHMS; DECISION THEORY; DYNAMIC PROGRAMMING; PROBLEM SOLVING; VECTORS;

STOCHASTIC DYNAMIC NETWORKS;

MARKOV PROCESSES;

EID: 0037209475     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00385-X     Document Type: Article

References (17)

1. Bazaraa M., Jarvis J., Sherali H. Linear Programming and Network Flows. second ed. 1990;Wiley, New York.
2. Bertsekas D., Tsitsiklis J. An analysis of stochastic shortest path problems. Mathematics of Operations Research. 16:1991;580-595.
3. Bertsimas D., Van Ryzin G. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operations Research. 39:1991;601-615.
4. Bertsimas D., Van Ryzin G. Stochastic and dynamic vehicle routing in Euclidean plane with multiple capacitated vehicles. Operations Research. 41:1993;60-76.
5. Carraway R., Morin T., Moskowitz H. Generalized dynamic programming for multicriteria optimization. European Journal of Operational Research. 44:1990;95-104.
6. Current J., Min H. Multiobjective design of transportation networks: Taxonomy and annotation. European Journal of Operational Research. 26:1986;187-201.
7. Deo N., Pang C. Shortest path algorithms: Taxonomy and annotation. Networks. 14:1984;275-323.
8. Frank H. Shortest paths in probabilistic graphs. Operations Research. 17:1969;583-599.
9. Hall R. The fastest path through a network with random time-dependent travel times. Transportation Science. 20:1986;182-188.
10. Howard D. Dynamic Probabilistic Systems. 1970;Wiley, New York.
11. Martin J. Distribution of time through a directed acyclic network. Operations Research. 13:1965;46-66.
12. Martins E. On a multi-criteria shortest path problem. European Journal of Operational Research. 16:1984;236-245.
13. Mirchandani P. Shortest distance and reliability of probabilistic networks. Computer and Operations Research. 3:1976;347-355.
14. Psaraftis H., Tsitsiklis J. Dynamic shortest paths in acyclic networks with Markovian arc costs. Operations Research. 41:1993;91-101.
15. Ross S. Introduction to Stochastic Dynamic Programming. 1983;Academic Press, New York.
16. Ross S. Stochastic Process. second ed. 1996;Wiley, New York.
17. Wijerante A., Turnquist M., Mirchandani P. Multiobjective routing of hazardous materials in stochastic networks. European Journal of Operational Research. 65:1993;33-44.