Half Open Multi-Depot Heterogeneous Vehicle Routing Problem for Hazardous Materials Transportation

How to reduce the accidents of hazardous materials has become an important and urgent research topic in the safety management of hazardous materials. In this study, we focus on the half open multi-depot heterogeneous vehicle routing problem for hazardous materials transportation. The goal is to dete...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Sustainability Ročník 13; číslo 3; s. 1262
Hlavní autoři: Zhou, Zhongxin, Ha, Minghu, Hu, Hao, Ma, Hongguang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.02.2021
Témata:
Accidents
Algorithms
Energy consumption
Hazardous materials
Hazardous substances
Heuristic
Integer programming
Optimization
Risk assessment
Roads & highways
Sustainability
Transportation
Transportation industry
Transportation planning
Vehicles
China
ISSN:2071-1050, 2071-1050
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:How to reduce the accidents of hazardous materials has become an important and urgent research topic in the safety management of hazardous materials. In this study, we focus on the half open multi-depot heterogeneous vehicle routing problem for hazardous materials transportation. The goal is to determine the vehicle allocation and the optimal route with minimum risk and cost for hazardous materials transportation. A novel transportation risk model is presented considering the variation of vehicle loading, vehicle types, and hazardous materials category. In order to balance the transportation risk and the transportation cost, we propose a bi-objective mixed integer programming model. A hybrid intelligent algorithm is developed based on the ε-constraint method and genetic algorithm to obtain the Pareto optimal solutions. Numerical experiments are provided to demonstrate the effectiveness of the proposed model. Compared with the close multi-depot heterogeneous vehicle routing problem, the average risk and cost obtained by the proposed bi-objective mixed integer programming model can be reduced by 3.99% and 2.01%, respectively. In addition, compared with the half open multi-depot homogeneous vehicle routing problem, the cost is significantly reduced with the acceptable risk.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2071-1050
2071-1050
DOI:10.3390/su13031262