中文摘要：

随着经济的发展，有害物品的生产量和运输量都在不断的增长．在时变网络条件下的有害物品运输过程中，运输成本和运输风险随着时间的变化而有所不同．在时变网络条件下，获得有害物品运输的风险和成本的基础上，给出了有害物品运输过程中的路径选择的模型，此模型还考虑了有到达时间限制和允许在运输网络中等待的情况．然后设计了求解的算法，利用此算法可以获得时变条件下有害物品运输中的最短路，并对算法的复杂性进行了分析．最后给出了一个应用算例，证实了在时变条件下有害物品运输中进行等待可以在一定程度上减少成本和降低风险．

英文摘要：

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.