融合回溯算法在离场航班排序问题中的应用  

Application of Syncretic Backtracking Algorithm in Departure Flight Scheduling Problem

作　　者：李楠[1] 刘来永[1] 徐肖豪[1] 

机构地区：[1]中国民航大学空管学院,天津300300

出　　处：《计算机仿真》2012年第6期88-92,共5页Computer Simulation

基　　金：中央高校基本科研业务经费(ZXH 2009D004);国家自然基金重点项目(61039001)

摘　　要：在离场航班优化排序问题的研究中,针对特定的情况,塔台管制员需要提高机场容量或者减少航班延误时间,要求管制员给出一个理想的离场航班排序方式。鉴于以上两种情况,首先根据ICAO规定的的起飞飞机间雷达间隔要求(尾流间隔和非尾流间隔),建立了飞机离场排序问题的数学模型。然后融合位置约束交换算法,并考虑航路流控的影响,设计融合回溯算法。采用以重庆江北机场为例进行仿真验证,结果显示,在不存在航路流控和存在航路流控两种情况下,都可以得到大大减少航班延误时间的排列和提高机场容量的排列,证明运用回溯算法可解决离场排序问题的高效性。In a certain circumstance, a tower controller needs to improve the capacity of airport or reduce the flight delay, which requires an ideal flight sequence provided by the controller. According to the two situations a- bove, firstly a mathematical model for departure aircraft scheduling problem was established in this paper according to the radar separation （ wake turbulence separation and non - wake turbulence separation） provided by ICAO. Then by integrating constrained position shifting algorithm and regarding the influence of enroute flow control, we designed the syncretic backtracking algorithm. At last, taking Chongqing Jiangbei Airport as an example, we performed a simula- tion. The result shows that we can get the sequence, whether in the condition with air traffic flow control or not, which can reduce the flight delays greatly or improve the capacity of airport. So using backtracking algorithm to solve departure scheduling problem is efficient and feasible.

关 键 词：离场排序 回溯算法 起飞 调度 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]