Makespan minimization in aircraft landing problem under congested traffic situation using modified artificial bee colony algorithm

K. Ng, C. K. M. Lee
{"title":"Makespan minimization in aircraft landing problem under congested traffic situation using modified artificial bee colony algorithm","authors":"K. Ng, C. K. M. Lee","doi":"10.1109/IEEM.2016.7797976","DOIUrl":null,"url":null,"abstract":"Due to the increase in air transportation demand, runway capacity is reaching a bottleneck at the international airports, especially during peak hours. Managing on aircraft sequencing or sequencing problems in airport perspective have become a crucial operation nowadays in order to maintain safety landing and utilize the runway facility to handle the schedules for all incoming aircraft under congestion. The traditional approach allows aircraft to remain an economic speed during approaching to the airport. However, such approach may not be applicable in congested air traffic situation. Therefore, the makespan minimization is more practical for the rescheduling efforts afterwards. This article presents a modified artificial bee colony algorithm to obtain nearly optimal solution to support the air tower controller in order to obtain last-minute decisions of landing sequence. The modified artificial bee colony algorithm for aircraft landing problem provides a promising optimal search within 6.1 seconds to handle last-minute disruption.","PeriodicalId":114906,"journal":{"name":"2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2016.7797976","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

Due to the increase in air transportation demand, runway capacity is reaching a bottleneck at the international airports, especially during peak hours. Managing on aircraft sequencing or sequencing problems in airport perspective have become a crucial operation nowadays in order to maintain safety landing and utilize the runway facility to handle the schedules for all incoming aircraft under congestion. The traditional approach allows aircraft to remain an economic speed during approaching to the airport. However, such approach may not be applicable in congested air traffic situation. Therefore, the makespan minimization is more practical for the rescheduling efforts afterwards. This article presents a modified artificial bee colony algorithm to obtain nearly optimal solution to support the air tower controller in order to obtain last-minute decisions of landing sequence. The modified artificial bee colony algorithm for aircraft landing problem provides a promising optimal search within 6.1 seconds to handle last-minute disruption.
基于改进人工蜂群算法的拥挤情况下飞机降落最大限时问题
由于航空运输需求的增加,国际机场的跑道容量正达到瓶颈,尤其是在高峰时段。从机场的角度出发,对飞机排序或排序问题进行管理已成为当今机场的一项重要工作,以保证安全着陆,并利用跑道设施来处理拥堵情况下所有进港飞机的时间表。传统的方法允许飞机在接近机场的过程中保持经济速度。然而,这种方法可能不适用于拥挤的空中交通情况。因此,最大时间跨度最小化对于后续的重新调度工作更为实用。本文提出了一种改进的人工蜂群算法,以获得近最优解,以支持空管塔台管制员获得着陆顺序的最后决策。改进的人工蜂群算法为飞机降落问题提供了一个有希望的最优搜索,在6.1秒内处理最后一刻的中断。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信