基于最小最大准则的危险品运输网络优化研究  

Hazardous materials transportation network optimization based on min-max criterion

作　　者：辛春林[1,2] 张建文[2] 张艳东[1] 

机构地区：[1]北京化工大学经济管理学院,北京100029 [2]北京化工大学运营管理与战略决策中心,北京100029

出　　处：《中国安全科学学报》2016年第8期84-89,共6页China Safety Science Journal

基　　金：国家科技支撑计划项目(2015BAK39B02)

摘　　要：为研究不确定型区间风险数据情境下的危险品运输网络风险规避问题,采用最小最大准则,构建一个具有更强鲁棒性的危险品运输网络双层规划模型。结合求解最短路径的Dijkstra算法,设计出启发式算法,处理不确定型区间风险数据,通过实例求解并验证模型的有效性。实例测试结果表明:算法程序在运行过程中始终能够达到一种稳定状态,能够删除那些具有最大风险上界值的边,促使企业在运输危险品时,选择远离人口密集区域的运输路线,求解得到的危险品运输鲁棒性网络,可以解决危险品运输过程中路段产生风险波动的问题。In order to build a stable and robust network of hazardous materials transportation, the risk aversion problem of hazardous materials transportation network was studied under uncertain interval data situation. By minimax criterion in decision theory, a robust bi-level programming model was built for hazardous materials transportation network. Then based on Dijkstra algorithm, a heuristic algorithm was designed for solving the model through a case. Finally, validity of both the model and algorithm was verified. The results of case calculation show that algorithm program in operation can always reach a stable state, can always delete those edges having the greatest upper boundrisk values, that network formation can encourage enterprises to choose the transport of hazardous materials route away from densely populated areas, and that the robust network of hazardous materials transportation can avoid fluctuation risks on the road during the hazardous materials transport.

关 键 词：危险品运输 最小最大准则 网络优化 双层规划模型 DIJKSTRA算法 

分 类 号：X937[环境科学与工程—安全科学]