Feng Cao , Tieqiao Tang , Yunqi Gao , Oliver Michler , Michael Schultz
{"title":"Predicting flight arrival times with deep learning: A strategy for minimizing potential conflicts in gate assignment","authors":"Feng Cao , Tieqiao Tang , Yunqi Gao , Oliver Michler , 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}
引用次数: 0
Abstract
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.
期刊介绍:
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.