| 给定限制期条件下最小风险路径的选取算法 |
| |
| 引用本文： | 刘春林,何建敏,盛昭瀚.给定限制期条件下最小风险路径的选取算法[J].系统工程学报,1999,14(3):221-226. |
| |
| 作者姓名： | 刘春林 何建敏 盛昭瀚 |
| |
| 作者单位： | 东南大学经济管理学院,南京,210096 |
| |
| 摘 要： | 讨论在给定限制期情况下，边的长度（权值）为区间数的赋权图最小风险路径的选取算法，该算法将非线形比例路径问题的求解转化为最短路问题的变权迭代，算例及实际应用取得了令人满意的效果。
|
| 关 键 词： | 区间数 限制期 最小风险路径 非线性规划 算法 |
AN ALGORITHM TO SELECT THE MINIMUM RISK PATH BY A GIVEN DEADLINE |
| |
| Liu Chunlin,He Jianmin,Sheng Zhaohan.AN ALGORITHM TO SELECT THE MINIMUM RISK PATH BY A GIVEN DEADLINE[J].Journal of Systems Engineering,1999,14(3):221-226. |
| |
| Authors: | Liu Chunlin He Jianmin Sheng Zhaohan |
| |
| Abstract: | When arc lengths of a graph are interval numbers, it is a non linear problem to select an optimum path or a minimum risk path by a given deadline. However, this paper gives an algorithm to solve the problem by converting it to a series of shortest path problems. An example is presented, and the result is satisfactory. |
| |
| Keywords: | interval number deadline shortest path minimum risk path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
