带时间窗的时变多目标危险化学品道路运输路径优化

研究了危险化学品道路运输路径优化（VRP）问题，考虑了该问题的3个方面：1）路径选择涉及运输时间与运输风险两个目标；2）运输时间与风险具有时变特性；3）道路节点的服务时间窗限制。本文以运输时间和风险为多目标，综合考虑以上约束，建立了该问题的数学模型并设计了蚁群算法进行求解。求解结果表明该算法可以有效计算帕累托最优路径，决策者可结合实际问题和决策偏好作出最合适的决策，同时运输企业可依据不同时刻的运输结果制定车辆的出发时刻表，监管部门可通过合理规划各路径的服务时间窗及允许停留等待的节点来调节各路径运输时间及风险。

Path Selection of Hazardous Materials Road Transportation with Time Window and Multi-objectives

Focusing on the hazardous chemical’s vehicle route optimization problem (VRP), three main aspects are considered, which are 1) the path selection involving two goals, time and risk of the transportation; 2) the time and risk of transportation being time-dependent; 3) the road’s nodes having service time window constraints. Based on multiple objectives of transportation time and risk and above constraints, a mathematical model for the problem is established and an ant colony algorithm to solve the problem is designed. The result shows that the algorithm can effectively show the Pareto optimal path so that policymakers can make the right decision with the actual problems and decision preference. At the same time, transportation enterprises can formulate vehicle departure timetable according to the result in different departure time while regulators can adjust the path’s transportation time and risk through planning node’s service time window and allowing a stopover in the node.