终端区飞机排序的人工蜂群算法  

Artificial Bee Colony Algorithm of Aircraft Sequencing in Terminal Area

作　　者：赵嶷飞[1] 朱潇[1] 王红勇[1] 

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

出　　处：《科学技术与工程》2013年第31期9258-9262,共5页Science Technology and Engineering

基　　金：国家科技支撑计划(2011BAH24B10);国家自然科学基金(61039001);国家自然科学基金委员会与中国民用航空局联合资助项目(U1333108)资助;中央高校基本科研业务费(ZXH2012M001)

摘　　要：为缓解终端区空中交通压力,研究了人工蜂群算法在终端区飞机降落排序中的应用。建立以航班总延误时间最小为目标函数的规划模型,运用人工蜂群算法,对着陆飞机排序问题进行了仿真计算;并与先到先服务算法、模拟退火算法、蚁群算法进行了对比研究。仿真结果表明:在双跑道模型下,人工蜂群算法比先到先服务算法,延误减少了48%。与模拟退火算法和蚁群算法相比,人工蜂群算法求解的结果最优,且用时最少。说明应用人工蜂群算法求解终端区飞机排序问题是可行的。In order to relieve air traffic pressure, the artificial bee colony algorithm （ABC） is apphetl to stucty sequencing and scheduling of landing aircraft in the terminal area. An object model with minimum total delay was developed. The sequence problem of landing aircraft was solved, and its computational result was compared with the ones computed by first-come-first-serve （FCFS） algorithm, SA algorithm and ant colony optimization （ACO） algorithm. Simulation result shows that the total delays are respectively reduced by 48% for double runways com- pared with FCFS algorithm, while the delay and computational time are least compared with SA algorithm and ACO algorithm, so the ABC algorithm is feasible to solve the aircraft sequencing problem in terminal area.

关 键 词：航空运输 航班进场排序 人工蜂群算法 

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