基于动态规划的航班着陆调度算法

摘要

为了解决机场终端区空中交通流量高速增长造成的进近冲突,合理安排飞机着陆次序,充分利用跑道容量,减少航班延误,提出了一种基于动态规划方法的航班着陆调度算法,算法结合了MPS约束、优化深度限制和时间窗限制约束和其他多项约束,并采用了动态规划的方法采减少计算量.仿真结果表明,算法能满足现实复杂空管条件下的各种限制约束,可应用于实时的ATC自动化系统,并能输出合理可行的排序结果,明显减少航班队列的延误.%To avoid approach congestion due to rapid increase of air traffic flows in the airport and terminal area,reduce flight delays and make full use of the runway capacity,an algorithm for scheduling landing aircraft based on dynamic program method is presented. It subject to IMP'S limiting, optimization depth limiting,and time- window limiting. The simulation results show that the dynamic programming algorithm can apply to any real complicated ATC environment and real- time ATC automation system,can receive a reasonable result of relative sequence of landing aircrafts, and it has been certificated usefully and minimized the schedule delay.