| 集装箱公铁联运的费用加权最短路计算机算法 |
| |
| 引用本文： | 贺国先.集装箱公铁联运的费用加权最短路计算机算法[J].铁道学报,2006,28(1):1-5. |
| |
| 作者姓名： | 贺国先 |
| |
| 作者单位： | 兰州交通大学,交通运输学院,甘肃,兰州,730070 |
| |
| 基金项目： | 兰州交通大学校科研和教改项目 |
| |
| 摘 要： | 结合公铁联运过程中承运、中转和交付的3个环节,借鉴Dijkstra标号算法思路,提出一种多阶段定向搜索的标号算法解决集装箱公铁联运费用最短路问题。该算法考虑路网中铁路线路和公路线路的区别,引入了集装箱办理站选择集的概念,并考虑集装箱办理站的中转费用。给出若干计算实例,编程计算的结果证明该算法具有实际意义和高可靠性。
|
| 关 键 词： | 集装箱 最短路 多式联运 |
| 文章编号： | 1001-8360（2006）01-0001-05 |
| 收稿时间： | 2005-04-01 |
| 修稿时间： | 2005-07-19 |
Computer-aided Algorithm of the Cost Weighted Shortest Path Problem in Container Motor-rail Multimodal Transportation |
| |
| HE Guo-xian.Computer-aided Algorithm of the Cost Weighted Shortest Path Problem in Container Motor-rail Multimodal Transportation[J].Journal of the China railway Society,2006,28(1):1-5. |
| |
| Authors: | HE Guo-xian |
| |
| Institution: | School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, China |
| |
| Abstract: | 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. |
| |
| Keywords: | container shortest path multimodal transportation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
