CAJ | 학술논문

讨论了机场终端区到达航班流的着陆调度规划问题。以航班总延误时间最小为目标函数，考虑了复杂的空中管制约束，提出了基于分组的MPS为1的隐枚举排序算法。该算法考虑了空中交通管制的多种约束条件，首先，分航路对航班进行分组；其次，根据约束条件初始化位置许可矩阵；然后建立解空间树搜索最优解。通过边界条件选取、无效分支判断、次优序列淘汰的设计提高了算法求解速度。结合真实数据，用计算机仿真实验对该算法进行了验证，结果表明，该算法能满足复杂空中交通管制条件下的各种限制约束，有效减少交通延误和提高空域利用率。
토론료궤장종단구도체항반류적착륙조도규화문제。이항반총연오시간최소위목표함수，고필료복잡적공중관제약속，제출료기우분조적MPS위1적은매거배서산법。해산법고필료공중교통관제적다충약속조건，수선，분항로대항반진행분조；기차，근거약속조건초시화위치허가구진；연후건립해공간수수색최우해。통과변계조건선취、무효분지판단、차우서렬도태적설계제고료산법구해속도。결합진실수거，용계산궤방진실험대해산법진행료험증，결과표명，해산법능만족복잡공중교통관제조건하적각충한제약속，유효감소교통연오화제고공역이용솔。
The approach aircraft landing scheduling problem in the terminal area is discussed in this paper. Taking the flights’ minimum total delay as the objective function, this paper proposes an implicit enumeration sorting algorithm with packet-based max position shift (MPS) = 1. It takes into account a variety of air traffic control constraints. Firstly the flights in same route bound to group lock, and then the position-matrix is initialized according to constraints, finally the solution space tree is built to search the optimal solution. The computing speed of the algorithm is improved effectively by selecting the boundary conditions, judging the invalid branch, and eliminating second-best series out. The results indicate that the algorithm can apply to complicated air traffic control (ATC) environment, and can greatly reduce the delay and increase airspaces’ availability.