.png){kind=icon}
返回
Dynamic programming and minimum risk paths
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2005.03.042.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation which can be considered an extension of usual dynamic programming models: path costs are recursively computed via functions which are assumed to be monotonic. A large part of the paper is devoted to analyze in detail this formulation and provide some new results. Based on the dynamic programming model a linear programming model is also presented to compute minimum risk paths. This formulation turns out to be useful in solving a biobjective version of the problem, in which also expected travel length is taken into consideration. This leads to define nondominated mixed strategies. Finally it is shown how to extend the basic updating device of dynamic programming in order to enumerate all nondominated paths. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
routing
risk analysis
dynamic programming
multiple objective programming
hazardous materials
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Deuterium inventory determination in beryllium and mixed beryllium-carbon layers doped with oxygen
PREAI
分享收藏
没有更多内容
没有更多内容