摘要
结合公铁联运过程中承运、中转和交付的3个环节,借鉴Dijkstra标号算法思路,提出一种多阶段定向搜索的标号算法解决集装箱公铁联运费用最短路问题。该算法考虑路网中铁路线路和公路线路的区别,引入了集装箱办理站选择集的概念,并考虑集装箱办理站的中转费用。给出若干计算实例,编程计算的结果证明该算法具有实际意义和高可靠性。
Combining the three links of collection, transfer and delivery in multimodal transportation, a directional multi phase labeling algorithm is proposed to deal with the shortest path cost problem in container motorrail multimodal transportation, with reference to the Dijkstra labeling algorithm. The concept of the railway container freight station choice set is introduced in, railways and highways are differentiated, and delivery costs at container freight stations are included. Several computing examples are given. The designed computation program indicates that the algorithm is effective and practicable.
出处
《铁道学报》
EI
CAS
CSCD
北大核心
2006年第1期1-5,共5页
Journal of the China Railway Society
基金
兰州交通大学"青蓝"人才工程资助
关键词
集装箱
最短路
多式联运
container
shortest path
multimodal transportation
