A study of uncertainty problem in vehicles scheduling

Vehicle scheduling is a typical NP-hard problem involving task assignment, time arrangement, personnel arrangement and route selection. Something unexpected often happens to affect the original plan. In this paper, transportation with uncertain events is discussed in detail; an integer programming model is constructed to describe the vehicle scheduling problem. Regarding the uncertain events, firstly a result under certain situation is worked out, then the problem is re-optimized to revise the original result based on accident analysis. To deal with the difficulty of the solution, a heuristic and genetic algorithm is proposed to solve the problem. The results show such problem can be solved effectively with the presented method.