摘要
在运输过程中,往往不止有一种运输方式,可能同时有多种运输方式交叉,即存在多式联运的方式.同时,运输网络往往具有时变特性,其运输成本和运输时间等会随着时间的变化而变化.将多式联运的运输网络进行了变形,设计了时变网络条件下有到达时间限制多式联运的最短路径算法,并对算法的计算复杂性进行了分析.最后给出一个应用算例.
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.
出处
《系统工程学报》
CSCD
北大核心
2007年第2期205-209,共5页
Journal of Systems Engineering
基金
国家自然科学基金资助项目(70471039)
教育部新世纪优秀人才支持计划资助项目(NCET-04-0886)
关键词
最短路径
时变网络
多式联运
转运
成本
shortest path
time-varying network
multi-modal
transshipment
cost
