Study On Flight Arrival And Departure Sequencing Strategy Of Beijing Daxing International Airport

With the rapid development of China’s economy,both passenger and freight traffic in civil aviation are showing a continuous growth trend,leading to frequent occurrence of flight delays,airspace congestion,and other issues.However,medium and long-term traffic management strategies such as airport reconstruction and expansion or upgrading of equipment and facilities in the region cannot respond to the growth of traffic in a timely manner,and in the short term,aircraft conflicts,flight delays,and problems caused by traffic growth can be resolved to ensure the safety of aviation operations,is one of the urgent problems to be solved in the current civil aviation operation.Therefore,it is of practical significance to deeply study the flight scheduling problem,optimize the inbound and outbound flight sequences using optimal scheduling algorithms,and improve flight operation efficiency.Based on previous theoretical research and experimental verification,this thesis deeply studies the arrival and departure scheduling problem of multi runway airports.Firstly,it introduces the overall operational environment of flight arrival and departure,and the operational modes of multi runway airports.It specifically discusses the operational modes of open V-shaped runways,and analyzes the factors affecting the operation of multi runway airports.After that,the relevant airspace and time resource models for the arrival and departure sequencing problem were constructed,and the minimum runway delay time and maximum runway throughput efficiency were selected as the optimization objectives.The corresponding constraints were proposed,and the establishment of a multi-objective mathematical model for the arrival and departure sequencing of flights was completed.Subsequently,an optimization algorithm was designed for solving the sorting model.After analyzing the advantages and disadvantages of the Non Dominated Sorting Genetic Algorithms-Ⅱ(NSGA-Ⅱ),a sliding time window was introduced to dynamically improve the NSGA-Ⅱ algorithm,and the improved dynamic NSGA-Ⅱ algorithm was used to solve the model.Finally,a simulation experiment was conducted using the arrival and departure flight simulation data of Beijing Daxing International Airport.When using the dynamic NSGA-Ⅱalgorithm to solve the flight sequencing model,the results obtained were compared with the results obtained by the first come first serve algorithm,which improved the optimization target with the minimum runway delay time by 22.4%,and the optimization target with the maximum runway throughput efficiency by 20.1%.Compared with the operation results of the NSGA-Ⅱalgorithm and the segmented NSGA-Ⅱ algorithm,the overall delay time of the dynamic NSGA-Ⅱ algorithm for the target of runway delay time is reduced by 2134 seconds and 805 seconds,respectively,and the algorithm operation efficiency is also better than the other two scheduling modes of NSGA-Ⅱ algorithm.The feasibility and effectiveness of the dynamic NSGA-Ⅱalgorithm in solving the multi-objective flight arrival and departure scheduling optimization problem for multi runway airports with open V-shaped runway configurations are verified.