中文摘要：

在有害物品运输过程中，需要获得从起点到终点之间的最短路径。而在运输过程中，往往不止有一种运输方式，可能同时有多种运输方式交叉，即可能多式联运的方式存在，同时，有害物品的运输网络具有很强的时变特性。将运输网络进行变形，建立了在时变网络条件下多式联运有害物品的最短路模型，设计了求解时变条件下多目标多式联运的最短路的算法。利用此算法获得有害物品运输过程中从起点到终点之间的最短路，并对算法的计算复杂性进行了分析。最后，给出一个应用算例。

英文摘要：

In hazardous materials transportation, the shortest path problem is always wanted from the origin to the destination. In the transportation, there are many modes, such as truck, train, waterway, airplanes 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 path in the hazardous materials transportation with multiple modes in the time-varying network. In order to solving the problem, we transformed the transportation network. Then, we developed the model, proposed the label algorithm to the problem and gave the computational complexity of the algorithm. At last, a case was studied.