Research On Optimal Scheduling Of Airport Special Vehicles Under Complex Operating Environment

As an important indicator of air transport quality,flight punctuality has always been the focus of civil aviation companies and passengers.However,in recent years,the growth rate of flights has been too fast,and the total number of flights has exceeded the scope that the company can guarantee,resulting in a decline in the quality of air services.This trend is particularly evident in the punctuality rate.Therefore,in the context of the rapid development of the aviation industry,how to improve the support service capability has become the focus of aviation enterprises to improve their competitiveness.The ground support service is the most important link to ensure the normal operation of the flight,and sufficient ground support vehicles and reasonable use have become the key to improving the support capability.At present,most airports allocate vehicles mainly based on experience,but in case of emergency,there is often insufficient capacity.Therefore,it is necessary to dispatch special vehicles in the airport to improve the support capacity of the airport,thereby improving the efficiency and quality of aviation services.This paper focuses on the scheduling of special vehicles at airports.Firstly,the service process of special vehicles is analyzed.The research objects are ferry vehicles,refuelling truck,food truck,water truck,sewage truck,garbage truck,baggage transport vehicle and tractor.The integrated scheduling problem of special vehicles is simplified into multiple subproblems of parallel service and sequential service.Then,with the objective function of minimizing the number of vehicles used and the waiting time,travel time and replenishment time of various vehicles,and considering the constraints such as time window,resources and number of vehicles,a static model of airport special vehicle scheduling is established.For the static scheduling model,a multi-chromosomal nondominated sorting genetic algorithm(NSGA-Ⅱ algorithm)is proposed to solve the problem,and corresponding operators are designed to improve the efficiency of the algorithm.The static model considers multiple objectives from the perspective of overall optimality,while the dynamic model considers changes in flight information from the perspective of local optimality.For the dynamic scheduling model,in order to adapt to the constant changes of flight information caused by complex operation environment,the rolling time domain algorithm is used to optimize the entire flight schedule in stages.Finally,taking Shenzhen Bao’an International Airport as an example,the example is analyzed to verify the effectiveness of the proposed model and algorithm.The results show that the proposed algorithm outperforms the first-come-first-served algorithm and the fixed-priority single-chromosome NSGA-Ⅱ algorithm in both the number of vehicles and the total extra running time in terms of static vehicle scheduling.The formulation of the scheduling plan can optimize the allocation of special vehicle resources at the airport and improve the utilization rate of vehicles.In the aspect of dynamic vehicle scheduling,the dynamic scheduling model and rolling time domain algorithm proposed in this paper can solve the dynamic special vehicle scheduling problem under the changing flight information.It provides a theoretical basis for the airport to dispatch vehicles to deal with various emergencies.