Route Planning for Hazardous Materials Transportation in Time-varying Network
时变条件下有害物品运输的路径问题研究

According to the development of economy,the mount of Hazardous Materials Transportation is also increasing in yearly.Because the risk and cost the hazardous materials transportation are both time-varying.The paper developed the algorithm in route planning for hazardous materials transportation with waiting in the node of transportation network and constrain of time.By this algorithm,the shortest path will be got.Then,the computational complexity of this algorithm was discussed.At last,a case was studied.From the case,it is proved that the risk and cost can be reduced by waiting.