Research On Gate Scheduling Optimization Based On Mixed Integer Programming

The gate is an important facility and resource to maintain the normal operation of the airport,which belongs to one of the core resources of airport scene operation management,and all materials and passengers need to rely on the gate to complete the upper and lower aircraft.Due to the rapid growth of airport aviation traffic in recent years,the difficulty of aircraft dispatching is increased,and the phenomenon of flight delays is serious.At airports with relatively busy aviation operations,the contradiction between the loss of airlines and the limited resources on the ground at airport is increasing,the root cause is the lack of resources and reasonable planning for airport scenes.Therefore,it is of great significance to study airport gate dispatching.Combining with the above background,the gate is the important resource of the airport scene,taking the gate scheduling optimization problem as the research content,taking the gate and aircraft as the research object,establishing the mixed integer programming model,studying the problem of gate scheduling under different circumstances,combining the strategy advantages of different search algorithms.Finally,the branch and bound method and iterative neighborhood search algorithm are used to solve the problem of aircraft delay.The main research results obtained in order to maximize the use of gate resources to reduce aircraft delays,alleviate airport congestion and improve traffic conditions at the airport scene are as follows:Aiming at the phenomenon of aircraft delay,the optimal scheduling model of the minimum number of aircraft delays is designed,the conflict function and evaluation function are introduced,and the time interval between adjacent aircraft is connected by the conflict function to improve the performance of the model.According to the actual inbound and outbound data of aircraft,by using the branch and bound algorithm,an effective gate optimization scheduling is obtained by setting different buffer times.The scheme has significantly alleviated the phenomenon of aircraft delays and reduced the rate of aircraft delays at the airport scenes.Aiming at the activity time of aircraft in the gate,the mathematical model of integer programming based on time window is established,and the shadow constraint is designed by using the iterative neighborhood search algorithm to reduce unnecessary search and improve the search efficiency.In the case of an increase in the number of aircraft,the constraints relate to the time window and are not related to the number of aircraft.Regardless of the influence of the change of aircraft quantity,according to the minimum time interval of the gate,the matching degree of the aircraft and the gate,and the constraint limit of the virtual apron,the optimal gate is allocated to the aircraft by using the variable neighborhood descent search optimization.Experimental results show that the algorithm effectively reduces the aircraft delay time,realizes the optimal gate allocation,and ensures the feasibility of the gate allocation scheme.