单跑道混合起降飞机排序问题的优化算法研究

Optimization algorithm for sequencing of single-runway mixed arrival-departure aircrafts

针对单跑道混合起降飞机排序问题,考虑着陆队列的优先性以及最小时间间隔的复杂性,建立最小化队列完成时间的混合起降模型.为求解该模型,提出两种基于着陆优先的两阶段算法,即TPLP算法和M-TPLP算法.该两种算法的第一阶段均是将着陆队列从起降队列中分离,并用蚁群算法对其求解;在第二阶段,TPLP算法和M-TPLP算法分别在不允许和允许着陆飞机偏移已安排着陆时间的情况下,将起飞队列插入到已排着陆队列中,即确保了着陆飞机的不同优先性,在一定程度上能够为实际的空中交通流量管理提供理论依据.最后,通过仿真实验验证所提算法的有效性.

In order to solve the sequencing of mixed arrival-departure aircrafts, this paper develops an optimization model to minimize the makespan of the sequence. In addition, the model considers the priority of the landings and the complexity of the minimum separation time of the mixed arrival-departure sequence. Two kinds of two-phased algorithms with landing priority are proposed： TPLP algorithm and MTPLP algorithm. In the first stage of these two algorithms, landings are separated from the aircraft sequence, and ant colony algorithm is applied to get the optimal or near-optimal sequence result. In the second stage, departures are inserted into the landing sequence. During this stage, TPLP algorithm does not change the aircraft landing time while M-TPLP algorithm can change the aircraft landing time to some extent. These two new strategies give priority to landings, and are more practicable in air traffic controls. At last, the numerical studies verify the efficiency of the TPLP and M-TPLP algorithm.