基于混合动态规划算法的进场航班排序

Arrival Flights Sequencing Based on Hybrid Dynamic Programming Algorithm

在遵循优化并可行的算法设计理念下,为了更好解决终端区航班进场排序问题,本文提出一种混合动态规划算法。该算法在动态规划的基础上结合约束位置交换算法与滑动窗算法,将进场航空器合理分组、分阶段进行排序,综合考虑短期排序预测的灵活性和计算规模的适度,提高了算法的计算速度、灵活性和鲁棒性。仿真结果表明:与传统先到先服务算法相比,改进后的混合算法不仅能减少延误11.6%,计算速度快,而且还避免了与原次序的较大变化,便于管制策略的实施。

In order to better solve the problem of sequencing arrival flights in terminal area, a hybrid dynamic programming algorithm in compliance with the optimization and feasible algorithm design concept was proposed. Based on the combination of dynamic programming algorithms, the new hybrid algorithm was designed by combination of the constraint position switch algorithem and sliding window algorithm; it reasonably grouped and sorted the arriving aircraft into several phases. Through considering the short-term sequencing prediction flexibility and suitable computational scale,it improved the computational speed, flexibility and robustness of the algorithm. The simulation results show that with the traditional first come first serve algorithm, the improved hybrid algorithm can not only reduce delays by 11.6 %,with a rapid calculating speed, but also avoide large changes in the original order. It is better to facilitate the implementation of control strategies.