| 一种求解时变网络下多式联运最短路的算法 |
| |
| 引用本文： | 魏航,李军,刘凝子.一种求解时变网络下多式联运最短路的算法[J].中国管理科学,2006,14(4):56-63. |
| |
| 作者姓名： | 魏航 李军 刘凝子 |
| |
| 作者单位： | 1. 上海财经大学国际工商管理学院, 上海, 200433;2. 西南交通大学经济管理学院, 成都, 610031 |
| |
| 基金项目： | 国家自然科学基金;教育部跨世纪优秀人才培养计划 |
| |
| 摘 要： | 在运输过程中,往往不止有一种运输方式,可能同时有多种运输方式交叉,即可能多式联运的方式存在,不同的运输方式之间需要通过转运才可实现.同时,在运输过程中,成本、运输时间、风险等因素会随着时间的不同而变化.首先,将运输网络进行变形,然后给出了在时变网络条件下多式联运的最短路模型,设计了求解时变条件下多式联运的最短路的算法,利用此算法可以获得从起点到终点之间的最短路,并对算法的计算复杂性进行了分析.最后给出一个应用算例.
|
| 关 键 词： | 最短路 时变网络 多式联运 转运 成本 |
| 文章编号： | 1003-207(2006)04-0056-08 |
| 收稿时间： | 2005-08-22; |
| 修稿时间： | 2005年8月22日 |
An Algorithm for Shortest Path with Multi - Modal in Time - Varying Network |
| |
| WEI Hang,LI Jun,LIU Ning-zi.An Algorithm for Shortest Path with Multi - Modal in Time - Varying Network[J].Chinese Journal of Management Science,2006,14(4):56-63. |
| |
| 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. School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China |
| |
| Abstract: | In the transportation,there are many modes,such as truck,train,waterway,airplane and so on.The different mode has the different cost,but the different modes want to transship.Thus,there exists the transshipment in transportation.The paper wants to find the shortest path with multiple modes in the time-varying network.The problem also has constraints to the time and to the destination.In order to solving the problem,we transformed the transportation network and analyzed the transportation cost and transshipment cost.Then,we developed the label algorithm to the problem and gave the computational complexity of the algorithm.At last,a case was studied. |
| |
| Keywords: | shortest path time-varying network multiple modes transshipment cost |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《中国管理科学》浏览原始摘要信息 |
| 点击此处可从《中国管理科学》下载免费的PDF全文 |
|
