|
|||||
|
|
| 时变网络下多式联运的最短路径问题研究 | |
| 引用本文： | 魏航,李军,蒲云. 时变网络下多式联运的最短路径问题研究[J]. 系统工程学报, 2007, 22(2): 205-209 |
| 作者姓名： | 魏航 李军 蒲云 |
| 作者单位： | 1. 上海财经大学国际工商管理学院,上海,200433 2. 西南交通大学经济管理学院,四川,成都,610031 3. 西南交通大学研究生院,四川,成都,610031 |
| 基金项目： | 国家自然科学基金;教育部跨世纪优秀人才培养计划 |
| 摘 要： | 在运输过程中,往往不止有一种运输方式,可能同时有多种运输方式交叉,即存在多式联运的方式.同时,运输网络往往具有时变特性,其运输成本和运输时间等会随着时间的变化而变化.将多式联运的运输网络进行了变形,设计了时变网络条件下有到达时间限制多式联运的最短路径算法,并对算法的计算复杂性进行了分析.最后给出一个应用算例. |
| 关 键 词： | 最短路径 时变网络 多式联运 转运 成本 |
| 文章编号： | 1000-5781（2007）02-0205-05 |
| 收稿时间： | 2005-03-21 |
| 修稿时间： | 2005-03-212005-11-07 |
Study on the multi-modal shortest path in time-varying network |
|
| WEI Hang,LI Jun,PU Yun. Study on the multi-modal shortest path in time-varying network[J]. Journal of Systems Engineering, 2007, 22(2): 205-209 | |
| Authors: | WEI Hang LI Jun PU Yun |
| Affiliation: | 1. School of International Business Administration, Shanghai University of Finance and Economies, Shanghai 200433, China; 2. Sehool of Eeonomies and Management, Southwest Jiaotong University, Chengdu 6113031, China; 3. Graduate School, Southwest Jiaotong University, Chengdu 6113031, China |
| Abstract: | In the transportation,there are many modes,such as truck,train,waterway,airplane and so on.The paper tries to find the shortest path with multiple modes in the time-varying network in constrain of arrival time.In the time-varying network,the transportation time and cost are time-varying depending on the different time.In order to solve the problem,the transportation network is transformed and the transportation cost and transshipment cost are analyzed.Then,an algorithm solving the problem is developed and the computational complexity of the algorithm is discussed.At last,a case study is given. |
| Keywords: | shortest path time-varying network multi-modal transshipment cost |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |