利用深度学习预测航班到达时间:尽量减少登机口分配潜在冲突的策略

IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Transportation Research Part C-Emerging Technologies Pub Date : 2024-10-04 DOI:10.1016/j.trc.2024.104866
Feng Cao , Tieqiao Tang , Yunqi Gao , Oliver Michler , Michael Schultz
{"title":"利用深度学习预测航班到达时间:尽量减少登机口分配潜在冲突的策略","authors":"Feng Cao ,&nbsp;Tieqiao Tang ,&nbsp;Yunqi Gao ,&nbsp;Oliver Michler ,&nbsp;Michael Schultz","doi":"10.1016/j.trc.2024.104866","DOIUrl":null,"url":null,"abstract":"<div><div>Air transportation is frequently disrupted by factors such as weather and air traffic control, making it difficult for flights to strictly adhere to schedules, leading to frequent early arrivals or delays. These disruptions pose challenges to airport operations management, particularly in gate assignments, where potential conflicts and adjustments are often required. Unlike traditional methods that focus on enhancing robustness to reduce conflicts, this study adopts a Predict-then-Optimize (PO) framework, using predicted flight arrival times for gate assignments to avoid the need for robustness-related objectives. In the prediction phase, a CNN-LSTM-Attention deep learning model is developed to predict flight arrival times based on the historical data of a single airport, enhancing data availability and model practicality. In the optimization phase, a bi-objective gate assignment model is constructed, using predicted arrival times instead of scheduled times as input. An epsilon-constrained branch-and-price algorithm is developed to obtain non-dominated Pareto optimal solutions. Analysis using actual operational data from Beijing Capital International Airport shows that the prediction model achieves an accuracy of 93.27% for early arrivals and 83.6% for on-time flights. The epsilon-constrained branch-and-price algorithm outperforms heuristic algorithms in both the quantity and quality of Pareto solutions. Notably, the gate assignment strategy based on predicted arrival times significantly reduces potential conflicts, with a maximum reduction of 25.33% compared to the schedule-based strategy. This study demonstrates that the proposed gate assignment method, based on flight arrival time prediction, effectively mitigates the impact of arrival time uncertainty on gate assignments, providing a new approach to reducing potential conflicts without relying on robustness.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":null,"pages":null},"PeriodicalIF":7.6000,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Predicting flight arrival times with deep learning: A strategy for minimizing potential conflicts in gate assignment\",\"authors\":\"Feng Cao ,&nbsp;Tieqiao Tang ,&nbsp;Yunqi Gao ,&nbsp;Oliver Michler ,&nbsp;Michael Schultz\",\"doi\":\"10.1016/j.trc.2024.104866\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Air transportation is frequently disrupted by factors such as weather and air traffic control, making it difficult for flights to strictly adhere to schedules, leading to frequent early arrivals or delays. These disruptions pose challenges to airport operations management, particularly in gate assignments, where potential conflicts and adjustments are often required. Unlike traditional methods that focus on enhancing robustness to reduce conflicts, this study adopts a Predict-then-Optimize (PO) framework, using predicted flight arrival times for gate assignments to avoid the need for robustness-related objectives. In the prediction phase, a CNN-LSTM-Attention deep learning model is developed to predict flight arrival times based on the historical data of a single airport, enhancing data availability and model practicality. In the optimization phase, a bi-objective gate assignment model is constructed, using predicted arrival times instead of scheduled times as input. An epsilon-constrained branch-and-price algorithm is developed to obtain non-dominated Pareto optimal solutions. Analysis using actual operational data from Beijing Capital International Airport shows that the prediction model achieves an accuracy of 93.27% for early arrivals and 83.6% for on-time flights. The epsilon-constrained branch-and-price algorithm outperforms heuristic algorithms in both the quantity and quality of Pareto solutions. Notably, the gate assignment strategy based on predicted arrival times significantly reduces potential conflicts, with a maximum reduction of 25.33% compared to the schedule-based strategy. This study demonstrates that the proposed gate assignment method, based on flight arrival time prediction, effectively mitigates the impact of arrival time uncertainty on gate assignments, providing a new approach to reducing potential conflicts without relying on robustness.</div></div>\",\"PeriodicalId\":54417,\"journal\":{\"name\":\"Transportation Research Part C-Emerging Technologies\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.6000,\"publicationDate\":\"2024-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part C-Emerging Technologies\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0968090X24003875\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"TRANSPORTATION SCIENCE & TECHNOLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part C-Emerging Technologies","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0968090X24003875","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TRANSPORTATION SCIENCE & TECHNOLOGY","Score":null,"Total":0}
引用次数: 0

摘要

航空运输经常受到天气和空中交通管制等因素的干扰,航班难以严格遵守时刻表,导致航班经常提前到达或延误。这些干扰给机场运营管理带来了挑战,尤其是在登机口分配方面,经常需要进行潜在的冲突和调整。传统方法侧重于增强稳健性以减少冲突,与之不同的是,本研究采用了 "预测-然后-优化"(PO)框架,利用预测的航班到达时间进行登机口分配,从而避免了对稳健性相关目标的需求。在预测阶段,基于单个机场的历史数据,开发了一个 CNN-LSTM-Attention 深度学习模型来预测航班到达时间,提高了数据可用性和模型实用性。在优化阶段,构建了一个双目标登机口分配模型,使用预测到达时间而不是预定时间作为输入。为获得非支配帕累托最优解,开发了一种ε-约束分支-价格算法。利用北京首都国际机场的实际运行数据进行的分析表明,该预测模型对提前到达航班的预测准确率为 93.27%,对准点航班的预测准确率为 83.6%。在帕累托最优解的数量和质量方面,ε-约束分支-价格算法都优于启发式算法。值得注意的是,基于预测到达时间的登机口分配策略大大减少了潜在的冲突,与基于时间表的策略相比,最大减少了 25.33%。这项研究表明,基于航班到达时间预测的登机口分配方法能有效缓解到达时间不确定性对登机口分配的影响,为减少潜在冲突提供了一种不依赖稳健性的新方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Predicting flight arrival times with deep learning: A strategy for minimizing potential conflicts in gate assignment
Air transportation is frequently disrupted by factors such as weather and air traffic control, making it difficult for flights to strictly adhere to schedules, leading to frequent early arrivals or delays. These disruptions pose challenges to airport operations management, particularly in gate assignments, where potential conflicts and adjustments are often required. Unlike traditional methods that focus on enhancing robustness to reduce conflicts, this study adopts a Predict-then-Optimize (PO) framework, using predicted flight arrival times for gate assignments to avoid the need for robustness-related objectives. In the prediction phase, a CNN-LSTM-Attention deep learning model is developed to predict flight arrival times based on the historical data of a single airport, enhancing data availability and model practicality. In the optimization phase, a bi-objective gate assignment model is constructed, using predicted arrival times instead of scheduled times as input. An epsilon-constrained branch-and-price algorithm is developed to obtain non-dominated Pareto optimal solutions. Analysis using actual operational data from Beijing Capital International Airport shows that the prediction model achieves an accuracy of 93.27% for early arrivals and 83.6% for on-time flights. The epsilon-constrained branch-and-price algorithm outperforms heuristic algorithms in both the quantity and quality of Pareto solutions. Notably, the gate assignment strategy based on predicted arrival times significantly reduces potential conflicts, with a maximum reduction of 25.33% compared to the schedule-based strategy. This study demonstrates that the proposed gate assignment method, based on flight arrival time prediction, effectively mitigates the impact of arrival time uncertainty on gate assignments, providing a new approach to reducing potential conflicts without relying on robustness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
15.80
自引率
12.00%
发文量
332
审稿时长
64 days
期刊介绍: Transportation Research: Part C (TR_C) is dedicated to showcasing high-quality, scholarly research that delves into the development, applications, and implications of transportation systems and emerging technologies. Our focus lies not solely on individual technologies, but rather on their broader implications for the planning, design, operation, control, maintenance, and rehabilitation of transportation systems, services, and components. In essence, the intellectual core of the journal revolves around the transportation aspect rather than the technology itself. We actively encourage the integration of quantitative methods from diverse fields such as operations research, control systems, complex networks, computer science, and artificial intelligence. Join us in exploring the intersection of transportation systems and emerging technologies to drive innovation and progress in the field.
期刊最新文献
A User-Driven Prioritisation Process implementation and optimisation for ATFM hotspot resolution Scenario-level knowledge transfer for motion planning of autonomous driving via successor representation Pricing for multi-modal pickup and delivery problems with heterogeneous users LFF: An attention allocation-based following behavior framework in lane-free environments T3C: A traffic-communication coupling control approach for autonomous intersection management system
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1