关键词:

危险品网络设计, 风险公平, 不确定需求, 双层规划, 遗传算法

Abstract:

Hazardous materials transportation accidents have the characteristics of low probability and high consequences, and reducing the risk of accidents is the focus of research on hazardous materials transportation. The risk of hazardous materials transportation is accompanied by the uneven risk distribution in space. Previous studies have focused on the trade-off between the minimum total risk and the fairness of risk, but less consideration has been given to the transportation network in uncertain demand. Fluctuations in transportation demand may lead to increased risk. In order to solve the problem of hazardous materials network design considering risk fairness under uncertain demand, a double-layer mixed integer programming model for the design of transportation network with multiple origin-destination (OD) for hazardous materials is constructed. The problems are that the supervisor chooses the closed road section and the carrier chooses the optimal route, which are solved by the adaptive genetic algorithm and the local search algorithm respectively. An example analysis indicates that different demand scenarios, especially when some OD pairs are interrupted, produce different optimal network design schemes, and the genetic algorithm used is better than the local search algorithm when the running time is slightly longer.

Key words:

hazardous materials network design, risk equity, uncertain demand, bilevel programming, genetic algorithm