主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2006, Vol. ›› Issue (4): 56-63.

Previous Articles     Next Articles

An Algorithm for Shortest Path with Multi-Modal in Time-Varying Network

WEI Hang1, LI Jun2, LIU Ning-zi2   

  1. 1. School of International Business Administration, Shanghai University of Finance and Economics, Shanghai 200433, China;
    2. School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China
  • Received:2005-08-22 Revised:2006-07-05 Online:2006-08-28 Published:2012-03-07

Abstract: 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.

Key words: shortest path, time-varying network, multiple modes, transshipment, cost

CLC Number: