Vehicle scheduling problem of hazardous materials based on risk

Vehicle scheduling optimization of hazardous materials is one of effective means to prevent accidents and reduce the loss of lives and property. This paper studies the vehicle scheduling problem of Hazardous materials based on the transportation risks which vary with time, taking into account the cost constraints and allowing for waiting at the nodes of the network, that is, our problem is a risk-based constrained path-selection one together with the determination of the departure and waiting times at each node on the selected path in the time-dependent networks. After a mixed integer programming model is proposed, a novel heuristic algorithm is designed. The computational complexity of the algorithm is also analyzed. Finally, a numerical example is presented to show its validity and feasibility of this algorithm.