Work

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

Year: 2019

Type: article

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 ε-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.

Source: IEEE Access

DOI: 10.1109/access.2019.2956059

Authors: Zhen Zhou, Weidong Lei, Peng Wu, Bo Li, Yunfei Fang

Institutions: Northwestern Polytechnical University, Xi'an University of Science and Technology, Fuzhou University, Informatique, BioInformatique, Systèmes Complexes, Université d'Évry Val-d'Essonne

Language: English

Topic: Risk and Safety Analysis

Subfield: Statistics, Probability and Uncertainty

Field: Decision Sciences

Domain: Social Sciences

SDGs: Industry, innovation and infrastructure, Sustainable cities and communities

Open Access status: gold

Estimated APC paid: $1,750