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

Abstract

Abstract:

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.

Key words: hazardous chemical； road transportation； route optimization； multiple objectives, time window, time-dependent

ZHU Ting1，WANG Xulei2, ZHAO Laijun1 . Path Selection of Hazardous Materials Road Transportation with Time Window and Multi-objectives[J]. Industrial Engineering Journal .

References

［1］MILLER-HOOKS E, MAHMASSANI H S. Least expected time paths in stochastic, time-varying transportation networks［J］. Transportation Science, 2000, 34(2): 198-215.
［2］BATTA R, CHIU S S. Optimal obnoxious paths on a network: transportation of hazardous materials ［J］. Operational Researeh, 1988,36(1):84992.
［3］LEONELLI P, BONVICINI S, SPADONI G. Hazardous materials transportation: a risk- analysis-based routing methodology［J］. Journal of Hazardous Materials. 2000, 71(1): 283-300.
［4］邹宗峰，张保全. 带混合时间窗的多目标危险化学品运输路径优化［J］. 中国安全科学学报, 2012(4)：83-89.
ZHOU Zongfeng, ZHANG Baoquan. Path optimization on dangerous chemicals transport with mixed time window of multi-objective［J］. Chinese Journal of Safety Science, 2012(4)：83-89.
［5］BRAINARD J, LOVETT A, PARFITT J. Assessing hazardous waste transport risks using a GIS［J］. Geographical Information Systems. 1996, 10(7): 831-850.
［6］WIJERATNE A B. Routing and scheduling decisions in the management of hazardous material shipments［D］. NY:Cornell University , 1990.
［7］周珣. 基于道路危险货物运输安全的路线优化研究［D］. 西安：长安大学，2004.
ZHOU Xun. Route optimization research based on hazmat transportation safety［D］. Xi′an: Chang′an University.
［8］ZOGRAFOS K G, ANDROUTSOPOULOS K N. A heuristic algorithm for solving hazardous materials distribution problems［J］. European Journal of Operational Research, 2004, 152(2): 507-519.
［9］KULKARNI V G. Shortest paths in networks with exponentially distributed arc lengths［J］. Networks, 1986,16(3): 255-274.
［10］任福田, 刘小明. 交通工程学［M］.2版.北京:人民交通出版社, 2008.
［11］王旭磊. 危险化学品道路运输风险分析与路线选择研究［D］. 上海:上海大学, 2012.
WANG Xulei. Hazardous material road transportation risk analysis and path selection study ［D］.Shanghai: Shanghai University,2012.

[1]	YAN Jun, CHANG Le, WANG Lulu, ZHAO Tong. A Solution Algorithm for the Problem of Taking Delivery Vehicle Path at the Same Time with Time Window [J]. Industrial Engineering Journal, 2021, 24(5): 72-76.
[2]	WANG Ning, ZHANG Yuping, ZHAO Jiao, JIN Ziyang. LIRP Model and Algorithm Considering Carbon Emission and Time Windows [J]. Industrial Engineering Journal, 2021, 24(2): 34-42.
[3]	LI Yumin, QIU Meng, HEI Bolin, FANG Zengli. Road-Rail Multimodal Transportation Routing Optimization of Fresh Products Considering High-speed Rail Time Window and Customer Satisfaction [J]. Industrial Engineering Journal, 2021, 24(2): 49-56.
[4]	WU Bin, SONG Yan, CHENG Jing, DONG Min. A Research on Vehicle Routing Problems with Time Windows Based on Density Peak Clustering [J]. Industrial Engineering Journal, 2020, 23(5): 58-66,74.
[5]	LI Bowei, HU Zuoan, JIA Yezi, TANG Shiyun. A Research on Vehicle Routing Problem with Simultaneous Pick-up and Delivery and Soft Time Windows [J]. Industrial Engineering Journal, 2020, 23(5): 75-81.
[6]	FENG Chun, QIN Bingfang, YE Lu. A Research on Distribution Problem of Electric Bicycle-sharing Batteries [J]. Industrial Engineering Journal , 2019, 22(3): 52-56.
[7]	HU Zuoan, JIA Yezi, LI Bowei, LIU Lu. An Optimization of the Vehicle Routing Problem Based on Customer Satisfaction [J]. Industrial Engineering Journal , 2019, 22(1): 100-107.
[8]	LIU Lanfen, YANG Xinfeng. Model and Algorithm of Vehicle Routing Problem for Urban Logistics in Time-Dependent Network [J]. Industrial Engineering Journal , 2017, 20(4): 18-24.
[9]	WANG Weijun, LUO Wei. A Research of Cold-chain Logistic Distribution Path Optimization Based on the Improved Intelligent Water Drop Algorithm [J]. Industrial Engineering Journal , 2017, 20(2): 38-43.
[10]	Ren Pan, Liu Ran, Jiang Zhi-bin, Dong Rui. Model and Algorithm for Fuel Consumption-Vehicle Routing Problem with Time Windows [J]. Industrial Engineering Journal , 2015, 18(5): 134-140.
[11]	Zhang Fan1,2, Tang Bing-yong1. Disruption Management in Vehicle Repair with Changes of -Time Windows and Repair Requirement from Customers [J]. Industrial Engineering Journal , 2015, 18(5): 148-153.
[12]	Xie Tian-bao1, Zhang Xiao-wen1, Wu Kai-bo2, Hu Dan1. A Study of Distribution Center Location Based on-Collaborative Distribution Under E-commerce [J]. Industrial Engineering Journal , 2015, 18(3): 75-81.
[13]	Lei Weidong, Che Ada. Scheduling Algorithm for Automated Mixed Production Line with Time Window Constraint [J]. Industrial Engineering Journal , 2011, 14(5): 110-115.