The Problem of Reserved-lane for Hazardous Chemicals Transportation and Heuristic Algorithm

Abstract

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.

Keywords

• hazardous chemicals transportation
• problem of reserved-lane
• Dijkstra algorithm
• heuristic algorithm