论文部分内容阅读
在货物起运地和目的地之间构建运输方式组合虚拟网络有向图,并将各种可选运输方式的总成本赋予在相应的虚拟网络图的有向路径上,将运输方式组合问题转化成该虚拟网络的最短路问题,然后通过集成运用Dijkstra启发式算法和k最短路算法,搜索检验出满足运输总时间要求的第k最小总成本,以实现运输总成本和运输总时间的最佳统一,可得出运输时间限定条件下的运输总成本最低的运输方式组合方案。
Construct a combination of transport mode virtual network directed graph between the place of goods departure and destination, and assign the total cost of all kinds of optional modes of transport to the corresponding directional path of the virtual network diagram, and transform the combination of transport modes into The shortest path problem of the virtual network, and then search for the kth smallest total cost that satisfies the requirement of total transportation time by integrating Dijkstra heuristic algorithm and k-shortest algorithm to achieve the best overall transportation total cost and total transportation time , We can get the transportation scheme with the lowest total cost of transportation under the limited transportation time.