Dynamic programming and minimum risk paths

European Journal of Operational Research

Volumn 175, Issue 1, 2006, Pages 224-237

  Serafini, Paolo ^a,b  

^a UNIVERSITY OF UDINE   (Italy)

^b CISM   (Italy)

Author keywords

Dynamic programming; Hazardous materials; Multiple objective programming; Risk analysis; Routing

Indexed keywords

COMPUTATIONAL METHODS; HAZARDOUS MATERIALS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; RISK ASSESSMENT; RISK MANAGEMENT;

MINIMUM RISK PATHS; MULTIPLE OBJECTIVE PROGRAMMING; RISK ANALYSIS; ROUTING;

DYNAMIC PROGRAMMING;

EID: 33749148049     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.03.042     Document Type: Article

References (15)

1. Baker K.R., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Operations Research 31 (1983) 381-386
2. Bellman R. On a routing problem. Quarterly Applied Mathematics 16 (1958) 87-90
3. Cooke K.L., and Halsey E. The shortest route through a network with time dependent internodal transit times. Journal of Mathematical Analysis and Applications 14 (1966) 493-498
4. Dijkstra E.W. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959) 269-271
5. Erkut E., and Verter V. Modeling of transport risk for hazardous materials. Operations Research 48 (1998) 624-642
6. Ford, L.R., 1956. Network flow theory. Technical Report P-923, The Rand Corporation.
7. Gondran M., and Minoux M. Graphes et algorithmes (1979), Editions Eyrolles, Paris, France
8. Halpern J. The shortest route with time dependent length of edges and limited delay possibilities in nodes. Zeitschrift für Operations Research 21 (1977) 117-124
9. Halpern J., and Priess I. Shortest paths with time constraints on movement and parking. Networks 4 (1974) 241-253
10. Hansen P. Bicriterion path problems. In: Fandel G., and Gol T. (Eds). Multiple Criteria Decision Making: Theory and Applications, Lecture Notes in Economics and Mathematical Systems (1980), Springer, Berlin 177
11. Luce R.D., and Raiffa H. Games and Decisions: Introduction and Critical Survey (1957), Wiley, New York, NY
12. Minoux M. Structures algébriques généralisées des problèmes de cheminement dans les graphes: Théorèmes algorithmes at applications. R.A.I.R.O.-Recherche opérationnelle 10 (1976) 33-62
13. Moore, E.F., 1957. The shortest path through a maze. In: Proceedings of the International Symposium on the Theory of Switching, 1957. Harvard University Press, 1959.
14. Puterman M.L. Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994), Wiley, New York, NY
15. Serafini, P., 1987. Some considerations about computational complexity for multi objective combinatorial problems. In: Krabs, W. Jahn, J. (Eds.), Recent Advances and Historical Developments of Vector Optimization. Springer, Lecture Notes in Economics and Mathematical Systems, pp. 222-232.