Research On Problems Of Runway Scheduling Based On Taxiway Routing

With the rapid development of civil aviation industry and the increasing demand for civil aviation transportation,the passenger and cargo throughput of major busy airports in China is increasing day by day,and the number of aircraft operating on airport surface is increasing.As a result,the problem of surface congestion in busy airports is becoming more and more serious.Taxiway system and runway system,as the core components of airport surface resources,are in urgent need of joint dispatching research in the process of airport surface movement operation.After analyzing the common conflict problems in airport taxiing,this paper uses QPPTW algorithm to solve the problem of choosing conflict-free taxiing path for the arrival and departure aircraft.QPPTW algorithm decomposes the taxiing problem of the arrival and departure aircraft into two stages.The first stage uses the idea of labeling to search the taxiing path with the minimum taxiing time for the aircraft.The second stage updates the time window of the airport directed graph based on the first stage to provide the taxiing operation of the next aircraft so as to avoid conflicts.Taking Guangzhou Baiyun International Airport as an example,the algorithm is experimentally conducted.In addition,in order to reduce the taxiing time of aircraft and the delay time of aircraft arriving at runway,a Mixed Integer Linear Programming for runway queue joint optimization problem based on taxiing path selection is established.By abstracting the two parallel runways and part of the apron connected to the runway and taxiway of Guangzhou Baiyun Airport,the directed graphs of the departure aircraft and the arrival aircraft are formed respectively.Considering the runway crossing of arrival aircraft,the time-space connection relationship of the aircraft taxiing on the airport surface is established.Analysis and detection of possible conflict location are conducted.What’s more,effective methods of conflict avoidance are proposed here.In the end,the ILOG CPLEX optimizer software is used to calculate the model.According to the experimental results,this paper shows that QPPTW algorithm can make full use of taxiway resources,effectively avoid conflicts,shorten taxiing time of aircraft,and improve the resource utilization of taxiway system.Based on this,this paper proposes a joint optimization model for runway queue problem based on taxiing path selection.Constraints of conflict avoidance are applied to effectively cope with conflicts,and also solve the runway incursion problem caused by crossing the runway during aircraft taxiing.The combined optimization model can reduce the taxiing time of aircraft and optimize the queue of runway waiting position,thus effectively improve the efficiency of airport surface movement operation.The research results can provide theoretical basis and decision support for the optimization of large busy airport surface movement operation.