基于混合动态规划算法的进场航空器优化排序

Optimization of Scheduling of Arrival Aircraft Based on Hybrid Dynamic Programming Algorithm

为解决终端区内进场航空器排序问题,提出一种混合动态规划算法。算法在动态规划的基础上,结合CPS算法和滑动窗算法,将进场航空器分组进行排序。排序过程综合考虑了短期预测排序的灵活性和航班间的公平性,提高了算法计算速度以及进场排序鲁棒性。仿真结果表明,算法具有较好的适用性,且与FCFS算法相比,可减少延误11.5%。

In order to solve the problem of arrival aircraft scheduling in the terminal area,this paper proposes a hybrid dynamic programming algorithm. Based on dynamic programming,this algorithm combines CPS algorithm and sliding window algorithm to sort arrival aircraft groups. Comprehensive consideration of the flexibility of short-term prediction sequencing and fairness between flights,improving the computational speed and robustness of the algorithm. The simulation results show that the algorithm has a good adaptability,and compared with the FCFS algorithm,the algorithm reduces the delay by 11. 5%.