基于货运时间和成本的运输方式组合方法

Combination of Freight Transport Modes Based on Transportation Time and Cost

在货物起运地和目的地之间构建运输方式组合虚拟网络有向图,并将各种可选运输方式的总成本赋予在相应的虚拟网络图的有向路径上,将运输方式组合问题转化成该虚拟网络的最短路问题,然后通过集成运用Dijkstra启发式算法和k最短路算法,搜索检验出满足运输总时间要求的第k最小总成本,以实现运输总成本和运输总时间的最佳统一,可得出运输时间限定条件下的运输总成本最低的运输方式组合方案。

The virtual network map of different combinations of transport modes between the starting place and the destination is constructed. Through endowing the different transport costs to the paths 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, searching and inspection the kth lowest total cost which meets the request of the total of freight time. So, the scheme of the lowest transport cost combination of transport modes with the limit of freight time can be chosen effectively.