终端区飞机排序的规划模型和算法研究

对终端区到达飞机进行排序是终端区交通管理自动化系统的一项主要任务。提出了一种新的终端区规划排序模型，把飞机的排序问题看作等价于带有准备好时间的渐增周游店员问题，并给出了兼顾解的最优性和计算复杂性的快速启发式算法。分析了静态和动态两种情况，并且考虑了实际的运行限制。计算结果表明，所给模型和算法具有良好的规划性能，能较好地解决终端区排序问题，可应用于我国空中战术流量管制系统。

Research on the Scheduling Model and Algorithm for Aircraft Sequencing Problem in TMA

As one of the key tasks of the automatic air traffic management system, the aircraft sequencing problem about arranging landing sequence for the arrival traffic efficiently and quickly in congested conditions in the terminal area (TMA) is discussed in this paper. A new scheduling model and a fast heuristic algorithm are proposed. The sequencing problem is modeled as a cumulative traveling salesman problem (TSP) with ready time, static and dynamic, two cases, are considered, and a set of constraints are added to the basic model to satisfy the operation limits. At last, the computational results show that the heuristic algorithm has perfect scheduling performance and can be applied to domestic air traffic tactic flow management system.