A Distributed Metaheuristic Approach for Complexity Reduction in Air Traffic for Strategic 4D Trajectory Optimization

Paveen Juntama, S. Chaimatanan, S. Alam, D. Delahaye
{"title":"A Distributed Metaheuristic Approach for Complexity Reduction in Air Traffic for Strategic 4D Trajectory Optimization","authors":"Paveen Juntama, S. Chaimatanan, S. Alam, D. Delahaye","doi":"10.1109/AIDA-AT48540.2020.9049200","DOIUrl":null,"url":null,"abstract":"This paper presents a new challenge on the strategic 4D trajectory optimization problem with the evaluation of air traffic complexity by using the geometric-based intrinsic complexity measure called König metric. The demonstration of König metric shows the potential that the algorithm can capture the disorganized the disorganized traffic which represents the difficulty of maintaining situational awareness as expected by the air traffic controller. We reformulate the optimization problem with two trajectory separation approaches including delaying flight departure time and allocating the new flight level subject to limited delay time of departure, limited changes of flight levels and fuel consumption constraints. We propose our solution to solve daily traffic demands in the regional French airspace. The resolution process uses the distributed metaheuristic algorithm to optimize aircraft trajectories in 4D environment with the objective of finding the optimal air traffic complexity. The experimental results shows the reduction of maximum complexity more than 95 % with average delay of 2.69 minutes. The optimized trajectories can save fuel more than 80000 kg. The proposed algorithm not only reduces the air traffic complexity but also maintain its distribution in traffic. The research results represent further steps towards taking other trajectory separations methods and aircraft trajectory uncertainties into account, developing our approach at the continental scale as well as adapting it in the pre-tactical and tactical planning phase.","PeriodicalId":106277,"journal":{"name":"2020 International Conference on Artificial Intelligence and Data Analytics for Air Transportation (AIDA-AT)","volume":"16 16","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Artificial Intelligence and Data Analytics for Air Transportation (AIDA-AT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIDA-AT48540.2020.9049200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

This paper presents a new challenge on the strategic 4D trajectory optimization problem with the evaluation of air traffic complexity by using the geometric-based intrinsic complexity measure called König metric. The demonstration of König metric shows the potential that the algorithm can capture the disorganized the disorganized traffic which represents the difficulty of maintaining situational awareness as expected by the air traffic controller. We reformulate the optimization problem with two trajectory separation approaches including delaying flight departure time and allocating the new flight level subject to limited delay time of departure, limited changes of flight levels and fuel consumption constraints. We propose our solution to solve daily traffic demands in the regional French airspace. The resolution process uses the distributed metaheuristic algorithm to optimize aircraft trajectories in 4D environment with the objective of finding the optimal air traffic complexity. The experimental results shows the reduction of maximum complexity more than 95 % with average delay of 2.69 minutes. The optimized trajectories can save fuel more than 80000 kg. The proposed algorithm not only reduces the air traffic complexity but also maintain its distribution in traffic. The research results represent further steps towards taking other trajectory separations methods and aircraft trajectory uncertainties into account, developing our approach at the continental scale as well as adapting it in the pre-tactical and tactical planning phase.
空中交通策略四维轨迹优化复杂性降低的分布式元启发式方法
本文利用基于几何的内在复杂度度量König度量,对战略四维轨迹优化问题提出了新的挑战。König度量的演示显示了该算法可以捕获无序交通的潜力,无序交通代表了保持空中交通管制员预期的态势感知的困难。在有限的起飞延迟时间、有限的飞行高度变化和燃油消耗约束下,采用延迟起飞时间和分配新飞行高度两种轨迹分离方法对优化问题进行了重新表述。我们提出解决方案,以解决法国区域空域的日常交通需求。求解过程采用分布式元启发式算法对四维环境下的飞机轨迹进行优化,目标是找到最优的空中交通复杂度。实验结果表明,最大复杂度降低95%以上,平均延迟2.69分钟。优化后的弹道可节省燃料8万公斤以上。该算法不仅降低了空中交通复杂度,而且保持了其在交通中的分布。研究结果代表了考虑其他弹道分离方法和飞机轨迹不确定性的进一步步骤,在大陆尺度上发展我们的方法,并在战术前和战术规划阶段进行调整。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信