机场场面飞机滑行调度优化问题的MILP模型及算法

摘要

本文考虑了顺序约束、安全约束、起始与终止时间约束和速度约束四种约束,建立了以总滑行时间最小为目标函数的机场场面飞机滑行调度优化的MILP模型.该模型求解分解为两步,先用遗传算法求解各航班经过交叉点的顺序,然后再求解各航班到达各节点的时间.最后结合国内某枢纽机场的航班信息,对模型进行仿真实验,结果表明本文提出的MILP模型有效解决了滑行冲突.%An optimization MILP model for aircrafts taxi scheduling in the airport surface has been presented in this paper. The proposed model takes into account four kinds of constraints which are sequencing constraints, safety constraints, origin and destination timing constraints, speed constraints, and aims the minimization of the total taxi time as objective function. The optimization model firstly determines the sequence of all the aircraft at each taxi intersection, and then solves the time of all the aircraft at each vertex. At last a domestic hub airport taxi scheduling simulation shows that the proposed MILP model is an effective solution to the taxi conflict.