| 时变条件下有宵禁限制的最短路问题 |
| |
| 引用本文： | 魏航,李军,刘凝子.时变条件下有宵禁限制的最短路问题[J].系统工程学报,2007,22(4):359-366. |
| |
| 作者姓名： | 魏航 李军 刘凝子 |
| |
| 作者单位： | 1. 上海财经大学国际工商管理学院,上海,200433;上海财经大学500强企业研究中心,上海,200433
2. 西南交通大学经济管理学院,四川,成都,610031 |
| |
| 基金项目： | 国家自然科学基金;教育部跨世纪优秀人才培养计划 |
| |
| 摘 要： | 在组合优化过程中,往往需要获得从起点到终点之间的最短路,而其所考虑的目标可能是一个与时间相关的变量.同时,对于网络中的节点往往有宵禁的限制(curfews).给出时变条件下有软、硬宵禁限制的最短路模型,设计了求解时变条件下有宵禁限制最短路的算法,并对算法的复杂性进行了分析.最后给出了一个应用算例.
|
| 关 键 词： | 最短路 时变 宵禁 标号法 |
| 文章编号： | 1000-5781（2007）04-0359-08 |
| 收稿时间： | 2005-09-02 |
| 修稿时间： | 2007-05-08 |
Time-varying shortest path problem with curfews |
| |
| WEI Hang,LI Jun,LIU Ning-zi.Time-varying shortest path problem with curfews[J].Journal of Systems Engineering,2007,22(4):359-366. |
| |
| Authors: | WEI Hang LI Jun LIU Ning-zi |
| |
| Institution: | 1. School of International Business Administration, Shanghai University of Finance and Economics, Shanghai 200433, China; 2. The Fortune 500 Company Research Center in Shanghai University of Finance and Economics, Shanghai 200433, China; 3. School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China |
| |
| Abstract: | Shortest path problem is a basic problem in the combinatorial optimization.The objective in the network is time-varying.Moreover,there will be curfews in some nodes in the network.The paper develops the models for time-varying shortest path problem with soft and hard curfews and gives the algorithm for them.Then,the complexity of the algorithm is discussed.At last,a case is studied. |
| |
| Keywords: | shortest path time-varying curfews labeling approach |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
