An Algorithm for Shortest Path with Multi-Modal in Time-Varying Network
Wei Hang · Zhongguo guanli kexue · 2006
In the transportation,there are many modes,such as truck,train,waterway,airplane and so on.The different mode has the different cost,but the different modes want to transship.Thus,there exists the transshipment in transportation.The paper wants to find the shortest path with multiple modes in the time-varying network.The problem also has constraints to the time and to the destination.In order to solving the problem,we transformed the transportation network and analyzed the transportation cost and transshipment cost.Then,we developed the label algorithm to the problem and gave the computational complexity of the algorithm.At last,a case was studied.