基于AATCSR-SA算法的多跑道进离场航班优化调度

Optimal scheduling of multi-runway incoming and outgoing flights based on AATCSR-SA algorithm

飞机在多个跑道上的调度问题可以建模为一个有准备时间、目标时间和截止时间的平行机器调度问题。安排起飞和着陆的飞机尽可能接近他们的计划时间,因此目标函数为总加权延迟最小。此外,所排飞机的序列应满足规定的最小时间间隔以避免尾流涡效应。因为在一定情况下它们不一定遵循三角不等式,这些间隔时间使问题变得更加困难。基于上述问题,提出了一种基于优先级规则的贪心算法与模拟退火算法相结合的启发式算法,即AATCSR-SA算法,在合理的计算范围内找出较好的调度方案。通过求解并进行比较,对算法的有效性进行了评价。

The scheduling problem of aircraft on multiple runways can be modeled as the parallel machine scheduling problem with preparation time,target time and deadline. The aircraft scheduled for takeoff and landing are as close to their planned time as possible,so the objective function is the minimum total weighted delay. In addition,the sequence of the aircraft should meet the specified minimum time interval to avoid the wake vortex effect. These intervals make the problem more difficult because under certain circumstances they do not necessarily follow trigonometric inequalities. Based on the above problems,a heuristic algorithm combining priority rule based greedy algorithm and simulated annealing algorithm(AATCSR-SA)is proposed in this paper. The algorithm finds out a better scheduling scheme in a reasonable calculation range,and its effectiveness is evaluated by solving and comparing it.