A New Efficient Algorithm for Hazardous Material Transportation Problem via Lane Reservation

Hazardous material transportation is well-known for its high potential risk. Minimizing the transportation risk is an important issue for hazardous material transportation. This paper focuses on a novel algorithm for the hazardous material transportation problem via lane reservation, whose goal is t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE access Ročník 7; s. 175290 - 175301
Hlavní autoři: Zhou, Zhen, Lei, Weidong, Wu, Peng, Li, Bo, Fang, Yunfei
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.01.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Accidents
Adaptation models
Algorithms
Computer Science
Computing time
Constraint modelling
cut-and-solve method
cutting plane
Hazardous materials
Integer programming
IP networks
Lane reservation
Network topologies
Operations Research
Risk
Roads
Routing
Transportation problem
transportation risk
Transportation risk
Cut-and-solve method
Cutting planeLane reservation
ISSN:2169-3536, 2169-3536
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í:Hazardous material transportation is well-known for its high potential risk. Minimizing the transportation risk is an important issue for hazardous material transportation. This paper focuses on a novel algorithm for the hazardous material transportation problem via lane reservation, whose goal is to obtain a best compromise between the impact on normal traffic due to lane reservation and the transportation risk. Firstly, a bi-objective integer programming model for the considered problem is formulated and transformed into a series of single objective models by ε-constraint method. For the transformed single objective models, a cut-and-solve and cutting plane combined method is proposed to reduce the computational time. The performance of the proposed algorithm is evaluated by an instance using a real network topology and randomly generated instances. Computational results demonstrate that the cut-and-solve and cutting plane combined method runs faster than direct use of software package CPLEX.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2019.2956059