Abstract: An airport taxi scheduling optimization strategy based on genetic algorithm was represented, which firstly determined the sequence of all the aircraft at each taxi intersection, and then solved the detailed scheduling. The optimization was found after some iterations. This strategy effectively enhances the solving efficiency in comparison with the Mixed Integer Linear Programming (MILP) model.

Key words: aircraft taxi scheduling, Genetic Algorithm (GA), Linear Programming (LP)

摘要： 提出一种基于遗传算法的滑行调度优化策略。该策略首先用遗传算法确定各航班经过交叉点的顺序，再根据上一步得到的顺序求解具体的调度计划，并反复迭代以逐渐优化，直到得到最优解或满意解。相对于混合整数线性规划（MILP）模型而言，有效地提高了求解效率，减少了求解时间。

关键词: 机场滑行调度, 遗传算法, 线性规划