摘要： 航空管制员必须为同时到达的每一架飞机计算着陆时间，使整体费用最小，同时还要注意一些硬性的限制条件。在某一时刻，给定管制员视野内的飞机数量，可以公式化为约束最优化问题，从而应用一定的算法来解决。该文提出了基于分枝定界的飞机着陆调度排序算法——ASAL，实验证明通过该算法能够很好地解决飞机着陆调度优化问题。

关键词: 飞机着陆调度, 最优化问题, 分枝定界

Abstract: The air traffic controller must compute a landing time for each aircraft in the horizon, and must attempt to minimize costs while observing a number of hard constraints.To give a certain number of aircraft within the air traffic controllers' horizon at a certain point in time, this problem can be formulated as a optimization problem and develop some algorithm for its solution. The paper presents an algorithm of scheduling aircraft landing time based on branch and bound(ASAL). Experiments show the proposed method is good at solving the problem of scheduling aircraft landing time.

中图分类号: 

• TP399