摘要
为解决终端区内各关键点处进离场航班之间的汇聚、交叉运行问题,综合考虑了间隔、容量等因素,以双跑道混合运行为前提,以总延误成本最小为目标,首次建立了考虑关键点进离场冲突的航班排序模型。设计了递归遗传算法:首先以各空域冲突点为单位,采用遗传算法得出延误成本最小的初始排队序列;之后以初始序列为基础,将经过同一定位点的航班进行聚类排序后反推回跑道,调整进离场航班间的间隔,再将进离场航班序列推算到各空域冲突点处,通过递归运算不断调整,最终得出进离场航班排队序列。根据仿真结果可知,所建模型和算法能有效解决实际运行中终端区各关键点对进离场航班运行的限制,大大减少了航班的总延误成本。
An important reason of terminal congestion was the conflict of arrival and departure aircraft in the cross point, which decreases the operation efficiency. To solve this problem, on the premise of mixed operation parallel runways, a model of sequen- cing considering the conflict of arrival and departure aircraft in cross-point to minimize the delay cost was first established with the consideration of the wake turbulence separation, departure separation, separation between two face to face aircraft , runway ca pacity and cross-point capacity. A recursive genetic algorithm was introduced for sequencing. The sequence with the minimum de- lay was determined by using genetic algorithm on the basis of conflicting points. Aircrafts that pass through the samelocation was classified and sequencing according to the wake turbulence separation was determined. The queue of each location was calculated for each runway using the recursive genetic algorithm to optimize the sequences. A new queue for each runway on basis of ensu- ring safety was recommended. As compared with the algorithm of first come first service （FCFS）, it was proved that the pro- posed model can solve the limitation to operation of each key point, reduce the aircraft delay cost, and improve the efficiency of ATM.
出处
《中国科技论文》
CAS
北大核心
2015年第19期2320-2324,共5页
China Sciencepaper
基金
国家自然科学基金委与中国民用航空局联合资助项目(61179042)
中央高校基本科研业务费专项资金资助项目(ZXH2012L005)
关键词
进离场航班冲突
关键点
双跑道
航班排序模型
递归遗传算法
conflict of arrival and departure aircraft
key point of airspace
parallel runways
sequencing
recursive genetic algo- rithm
