多跑道飞机降落排序快速优化方法  

A fast optimization method for multi-runway aircraft landing sequencing

作　　者：张勰[1] 刘宏志[1] 赵嶷飞[1] 

机构地区：[1]中国民航大学天津市空管运行规划与安全重点实验室,天津300300

出　　处：《飞行力学》2015年第5期467-470,共4页Flight Dynamics

基　　金：国家自然科学基金资助(U1333108);国家科技支撑计划资助(2011BAH24B10);中央高校基本科研业务费专项资助(3122014C020)

摘　　要：针对多跑道飞机降落排序这一典型的组合优化问题,建立了以延误代价最小为目标的优化模型,并提出了一种基于贪心策略的动态规划算法。在生成子节点时引入贪心策略,通过简化搜索过程的复杂度,提高算法运行效率,以解决问题规模增大导致计算效率低下的难题。仿真结果表明,该方法能够有效简化搜索过程,在优化效果与动态规划算法相当的情况下,有效降低了运算时间,证明了方法的有效性。Focusing on this typical combinatorial problem of sequencing the arrival aircraft for multi-runway,optimization model with minimum delay is established,and a dynamic programming algorithm based on greedy strategy is proposed. The greedy strategy is introduced while generating the nodes,and then reduces the searching complexity to improve the algorithm efficiency,so that the problem is solved that the computation efficiency decreases as the scale of the problem increases. Through the simulation,it is shown that the algorithm proposed here can simplify the searching process effectively,and the time is reduced effectively as the optimization effect is equivalent to the dynamic programming algorithm. The effectiveness of the algorithm is proved.

关 键 词：空中交通管理 降落排序 多跑道 贪心策略 

分 类 号：V355.2[航空宇航科学与技术—人机与环境工程]