Lowest Cost Combination of Freight Transport Modes with Limit of Time

摘要：

In the course of the entire freightage, there are usually different combinations oftransport modes can be chosen. With the limit time of whole freight, the combination of transport modes which causes the lowest cost will be chosen as the optimization. Firstly, the virtual network map of different combinations of transport modes between the starting place and the destination is constructed. Through endowing the different transport cost to the sections in the virtual network, the optimal problem of the combination of transport modes is converted into the shortest path problem of the virtual network. Finally, through integrating the Dijkstra heuristic algorithm and the kth shortest path algorithm, the scheme of the lowest transport cost combination of transport modes with the limit of freight time can be chosen effectively.

关键词： Combination of transport modes virtual network transport cost kth shortest path lgorithm

作者: HUANG Youheng HAO Hongxiang

作者单位: School of Logistics,Central South University of Forestry and Technology,China,410004 Nanhai Neusoft Institute of Information Technology,China,528225

会议类型: 国际会议

会议名称: 2009 International Conference on Management Science and Engineering(2009管理科学与工程国际会议)

会议地点: 北京

会议语种:英文

页码: 565-569

在线出版日期: 2009-11-01（万方平台首次上网日期，不代表论文的发表时间）