TY - JOUR
T1 - Bi-Objective Vehicle Routing for Hazardous Materials Transportation with No Vehicles Travelling in Echelon
AU - Wang, Nengmin
AU - Zhang, Meng
AU - Che, Ada
AU - Jiang, Bin
N1 - Publisher Copyright:
© 2000-2011 IEEE.
PY - 2018/6
Y1 - 2018/6
N2 - As a by-product of industrial development, large quantities of hazardous materials are shipped in the transportation network every day. The risk of transporting hazardous materials is an important consideration in transportation planning. Vehicle routing models in previous studies simultaneously minimized the transportation cost and the total risk. However, simply evaluating the total risk of a fleet as a whole does not consider each individual vehicle's risk. Even if the total risk is low, the risk of a specific vehicle may still be very high. In addition, the situation of several vehicles of a logistics company shipping hazardous materials and travelling on the same road together, called vehicles travelling in echelon, may cause a chain of incidents. This situation has been ignored in previous studies. In this paper, a bi-objective vehicle routing model for hazardous materials transportation with no vehicles travelling in echelon is developed, simultaneously minimizing the maximum risk of each vehicle and the transportation cost. A two-stage exact algorithm is developed based on the \varepsilon -constraint method with several improvements to solve the proposed problem. An approximation approach is proposed for this two-stage algorithm for large-scale problems. Furthermore, the approximation ratio and time complexity of this approximation algorithm are analyzed. Computational experiments with randomly generated instances are reported, and several managerial insights are derived from the sensitivity analysis.
AB - As a by-product of industrial development, large quantities of hazardous materials are shipped in the transportation network every day. The risk of transporting hazardous materials is an important consideration in transportation planning. Vehicle routing models in previous studies simultaneously minimized the transportation cost and the total risk. However, simply evaluating the total risk of a fleet as a whole does not consider each individual vehicle's risk. Even if the total risk is low, the risk of a specific vehicle may still be very high. In addition, the situation of several vehicles of a logistics company shipping hazardous materials and travelling on the same road together, called vehicles travelling in echelon, may cause a chain of incidents. This situation has been ignored in previous studies. In this paper, a bi-objective vehicle routing model for hazardous materials transportation with no vehicles travelling in echelon is developed, simultaneously minimizing the maximum risk of each vehicle and the transportation cost. A two-stage exact algorithm is developed based on the \varepsilon -constraint method with several improvements to solve the proposed problem. An approximation approach is proposed for this two-stage algorithm for large-scale problems. Furthermore, the approximation ratio and time complexity of this approximation algorithm are analyzed. Computational experiments with randomly generated instances are reported, and several managerial insights are derived from the sensitivity analysis.
KW - bi-objective optimization
KW - Hazardous materials transportation
KW - two-stage algorithm
KW - vehicle routing problem
KW - ϵ-constraint method
UR - http://www.scopus.com/inward/record.url?scp=85030657156&partnerID=8YFLogxK
U2 - 10.1109/TITS.2017.2742600
DO - 10.1109/TITS.2017.2742600
M3 - 文章
AN - SCOPUS:85030657156
SN - 1524-9050
VL - 19
SP - 1867
EP - 1879
JO - IEEE Transactions on Intelligent Transportation Systems
JF - IEEE Transactions on Intelligent Transportation Systems
IS - 6
ER -