Research On Airport Ground Service Vehicles Scheduling Problem Based On Multi-Strategy

With the rapid growth of China's air transportation,the continuous expansion of the airport and more complex airport services have brought tremendous pressure on the normality of flights.How to respond quickly and orderly to the guarantee service scheduling has become a key issue for the efficient operation of the airport.This topic aims to reduce the unnecessary time and cost loss generated when distributing service vehicles to improve the efficiency of the entire service task.This article is oriented to the scheduling problem of airport ground service vehicles under limited resources,and constructs a mathematical model of vehicles scheduling with the shortest total travel distance and minimum delay time as the optimization target.In order to effectively solve the model,this article considers various scenarios and designs two algorithms for optimization.(1)Considering the flexibility of services,it can quickly and effectively deal with the dynamic scheduling problem.For the scheduling requirements in such scenarios,this article propose a scheduling algorithm based on greedy strategy to make successive selections in an iterative way.The optimization targets are processed by normalization method,considering the distance between vehicles and flights and the constraints of flight refueling service time window on the choice of service flights,an evaluation function is designed,according to this evaluation value function,a greedy strategy for solving the problem of airport ground service vehicles scheduling is proposed.Finally,a set of service sequence of service vehicles is obtained by the algorithm.Examples show that the algorithm greatly improves the efficiency of ground service vehicle scheduling at an airport in Northwest China and reduces additional cost losses.(2)When considering from the decision maker's point of view,we hope to get a series of scheduling schemes and consider the characteristics of the solution of multi-objective optimization problem.The article designs an airport ground service vehicle scheduling algorithm based on improved non-dominated sorting algorithm with elite strategy(NSGA ?).The convergence of the algorithm is accelerated by elite reservation strategy.Hierarchical clustering is used instead of congestion distance to select individuals of the same rank in the non-dominated sorted population to increase the diversity of the population and the similarity measurement is improved to better the selection of merging points.Finally,knee points are selected as representative individuals to enter the next generation of population.A set of Pareto optimal solutions is generated by iterative evolution.The experimental result are compared with the existing algorithms that shows the improved algorithm is superior to the other two multi-objective optimization algorithms in solving the airport ground service vehicles scheduling problem.Aiming at an airport in Northwest China,the scheduling algorithm based on improved NSGA_? is used to solve the problem,and the scheduling schemes under multi-constraints is obtained.At the end of the article,the optimal scheduling scheme for service vehicles is obtained by Analytic Hierarchy Process(AHP),which provides theoretical guidance for decision makers.