Decision support tools for arrival sequencing and scheduling could assist air traffic controllers in managing the arrival aircraft in terminal areas. However, one critical issue is that the current method for dealing with the arrival sequencing and scheduling problem does not consider the dynamic traffic situation and the human working experience, which results in a deviation between the scheduled and actual landing sequences. This paper develops a data-driven method to address this issue. Firstly, the random forest model is applied to predict the estimated time of arrival (ETA). During the ETA prediction, the trajectory, operation, and airport-related factors that could increase the prediction accuracy are considered. Secondly, the landing sequence is obtained by sorting the predicted ETAs. Thirdly, two optimization methods are proposed to generate the scheduled time of arrival (STA). The former uses the predicted ETAs as inputs and then directly optimizes the landing sequence and the STA. The latter uses both the predicted ETA and the landing sequence as inputs for further optimization. Finally, these proposed methods are evaluated with three sets of historical data on arrival operations at Changsha Huanghua International Airport (ZGHA). The results show that the RF-based ETA prediction method could improve scheduling performance. Moreover, the proposed optimization methods could provide controllers with a more appropriate decision advisory. Such advisories could simultaneously reduce the operation efficiency indicators (average/maximum delay or dwell time) and the operation complexity indicators (Kendall rank correlation or position shift).
27 December 2025 in Transportation Research Part C: Emerging Technologies
Collaboration between terminal airspace and airport surface operation shows an increasing significance for the best efficiency of both parts of the air traffic management domain. Runways play a critical role in connecting the two parts for departure and arrival aircraft. Suppose the gate and the entry fix of an aircraft are predetermined according to the flight plan, and they are on the opposite side of the airport terminal. The aircraft will either spend more time (i.e., delay in the air) landing on a runway close to its gate or take a longer distance (i.e., detour on the ground) taxiing to its gate if a runway close to its entry fix is assigned. This paper proposes a runway assignment model considering terminal airspace operation and airport surface movement simultaneously to discover how runway assignments can affect integrated operations. Four different runway assignment schemes are applied in this model. Subsequently, a metaheuristic method is proposed to solve the model. Furthermore, the historical taxiing and flight time data are analyzed to demonstrate the potential benefits of runway reassignment. Finally, the results show that the free assignment of the runway stands out among the four schemes, not only in the performance of terminal airspace operation (lower flight time) but also in airport surface movement (lower pushback delay, taxi time).
The application of quantum physics principles has opened the door to a radically different way of conceiving and performing data computation. While still in its infancy, quantum computation offers the potential to efficiently solve problems that are classically considered intractable, thanks to the inherent parallelism granted by quantum effects like superposition and entanglement. The aim of this review is to discuss the potential applications of quantum computation in air transport problems by introducing its main concepts, in addition to how quantum algorithms are designed and their limitations, and then discussing solutions that have already been proposed in the literature. Finally, we draw some conclusions about the factors hindering wider application of quantum computation in air transport and sketch what the future may look like.