摘要
在运输过程中,往往不止有一种运输方式,可能同时有多种运输方式交叉,即可能多式联运的方式存在,不同的运输方式之间需要通过转运才可实现。同时,在运输过程中,成本、运输时间、风险等因素会随着时间的不同而变化。首先,将运输网络进行变形,然后给出了在时变网络条件下多式联运的最短路模型,设计了求解时变条件下多式联运的最短路的算法,利用此算法可以获得从起点到终点之间的最短路,并对算法的计算复杂性进行了分析。最后给出一个应用算例。
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 timevarying 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 algo- rithm. At last, a case was studied.
出处
《中国管理科学》
CSSCI
2006年第4期56-63,共8页
Chinese Journal of Management Science
基金
国家自然科学基金资助项目(70471039)
教育部新世纪优秀人才支持计划项目(NCET-04-0886)
关键词
最短路
时变网络
多式联运
转运
成本
shortest path
time- varyinig network
multiple modes
transshipment
cost
