基于优先级的航班到达调度算法

随着空中交通流量的迅猛增长，终端区空中交通拥堵以及由此导致的航班延误现象日益突出，甚至危及航空安全，航运效益也随之受到巨大的损失。作为终端区流量管理的核心，航班到达调度旨在为终端区待着陆的航班安排合理的着陆顺序和降落时刻，在确保安全的前提下提高进港航班运行效率。基于优先级思想，文章提出了PBSA和PBSA-CPS两种航班到达调度算法，并引入约束位置交换概念，以提高调度结果对于管制员的可操作特性。最后以首都机场为例进行了仿真，并与现行的先到先服务算法FCFS进行了对比。仿真结果表明，通过对航班赋予相应的优先级，有助于优化调配到达航班队列的降落时隙分配结果，提高终端区运行效率，减少延误损失。

Aircraft Arrival Scheduling Algorithm under Priorities

With the rapid growth of air traffic flow, air traffic congestion and flight delays in terminal area have become increasingly prominent, and even endanger aviation safety. As one of the core contents of Air Traffic Flow Management (ATFM) in terminal area, Aircraft Arrival Scheduling (AAS) determines an efficient landing scheduling scheme for a given set of aircrafts in order to insure the safety of aircrafts. We present two algorithms for optimizing arrival sequences of airport runway operations. Aircraft priorities were introduced to our two algorithms. Constraint Position Sifting (CPS) constraints were also added in order to make the scheduling results more acceptable to the air traffic controller. Validated with the practical data of the Beijing Capital International Airport of CAAC, the results shows our work is much better than the FCFS solver both in total delay cost and equity.