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

Zhen Zhou (1) , Weidong Lei (2) , Peng Wu (3) , Bo Li (4) , Yunfei Fang (5, 6)

1 School of Management, Northwestern Polytechnical University
2 School of Management, Post-Doctoral Research Station of Mining Engineering
3 School of Economics and Management
4 Glodon Technology Inc
5 School of Economics and Management
6 IBISC - Informatique, BioInformatique, Systèmes Complexes

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.

Keywords: Transportation risk; Cut-and-solve method; Cutting planeLane reservation

Domains: Operations Research [math.OC]

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