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

Abstract : 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\varepsilon-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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02428231
Contributor : Frédéric Davesne <>
Submitted on : Sunday, January 5, 2020 - 4:08:49 PM
Last modification on : Wednesday, January 8, 2020 - 1:34:07 AM

Links full text

Identifiers

Citation

Zhen Zhou, Weidong Lei, Peng Wu, Bo Li, Yunfei Fang. A New Efficient Algorithm for Hazardous Material Transportation Problem via Lane Reservation. IEEE Access, IEEE, 2019, 7, pp.175290--175301. ⟨10.1109/ACCESS.2019.2956059⟩. ⟨hal-02428231⟩

Share

Metrics

Record views

19