The Problem of Reserved-lane for Hazardous Chemicals Transportation and Heuristic Algorithm
1 School of Electro-Mechanical Engineering, Guangdong University of Technology, Guangzhou, Guangdong, China
2 Department of Computer Science, Guangdong University of Finance, Guangzhou, Guangdong, China
Hazardous chemicals transportation requires a high-level of security assurance. It is an effective transport strategy that reserved-lanes are set in a transportation route to avoid accidents such as rear-end collision and crash. However, other vehicles will be inevitably influenced if a lane is set as the reserved-lane. Thus, how to minimize the influence by setting the reserved-lane becomes a problem needed to be studied. The mathematical programming model of the reserved-lane setting for hazardous chemicals transportation is established in this paper. According to the characteristics of the problem, the heuristic algorithm based on Dijkstra algorithm is proposed. This algorithm is a simple and intelligible, satisfactory solution that can be obtained in polynomials.
Key words: hazardous chemicals transportation / problem of reserved-lane / Dijkstra algorithm / heuristic algorithm
© Owned by the authors, published by EDP Sciences, 2015
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.