Abstract: The aircraft sequencing problem is a salient problem in air traffic control, which proves to be nondeterministic polynomial(NP)hard. The reasonable methods for this problem will greatly improve the capacity of the runway and reduce the aircraft delay cost. In this paper, we address the static aircraft sequencing problem over a mixed-mode single runway, which commonly constitutes a critical bottleneck at airports. Firstly, the aircraft delay cost is related to operation mode (landing or taking off), the type of aircraft (heavy, large or small) and the importance of flight (consecutive or not). We design a priority table to reflect priority of scheduling based on consideration mentioned above, and convert the priority to delay cost coefficient. Secondly, to reduce the workload of controllers and to maintain some level of fairness among different aircrafts, we set several constraints, including the number of aircrafts which are allowed to deviate from their target arrival times or departure times, the adjacent aircraft constraint and the maximum position shifting constraint. Thirdly, in order to reduce the total delay cost of aircrafts, an improved ant colony algorithm based on priority (GJAC) is proposed. Lastly, the numerical study is conducted to verify the efficiency of GJAC algorithm. It proves that this algorithm is effective in reducing the total delay cost of sequence and has good solution quality.

Key words: priority, improved ant colony algorithm, mixed arrival-departure aircraft sequencing problem

摘要： 研究机场终端区进离港航班排序优化问题,对于提高跑道利用率以及降低航班延误损失具有重要意义。本文首先考虑航班运行方式(降落和起飞)、飞机类型以及航班的重要程度(航程是否连续)的不同所造成延误损失的不同,设计三维优先级表反映调度优先等级,并将其转化为延误成本系数。其次,为实现调度的公平性和减轻管制人员的工作负荷,设置允许延误的航班架次约束、邻边约束以及最大限制位置约束。再次,以最小化航班总延误成本为目标建立模型,提出相应的改进蚁群算法(GJAC)进行求解。最后通过数值实验验证所提算法在考虑调度优先等级及上述约束条件的同时能有效减少进离港航班队列的总延误成本。

关键词: 优先级, 改进蚁群算法, 进离港航班排序