MODEL AND ALGORITHM FOR THE SKILL CAPACITATED VRP WITH TIME WINDOWS IN AIRPORTS

Abstract

The scheduling efficiency of airport ground support vehicles is an important factor affecting the on-time performance of flights. In this paper, the Skill Capacitated Vehicle Routing Problem with Time Windows is proposed and the corresponding algorithm is designed for main airport ground support vehicles. Firstly, we decompose the transit process of flights using simple temporal network and time decoupling to obtain the time windows of each ground support service. Secondly, a vehicle scheduling model is constructed according to the characteristics of each vehicle, which aims at minimizing the number of vehicles used and balancing the workload of each vehicle. Finally, the elitist genetic algorithm with large neighbourhood search is designed to solve the problem and is compared with the standard genetic algorithm. The effectiveness of the model and the algorithm is illustrated by a real data example from Beijing Capital International Airport.