Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/118030
| Title: | Stabilised branch-and-check method for optimising multi-runway aircraft landing problem modelled through stochastic programming with learning-driven arrival time predictions | Authors: | Zhang, C Jin, Z Ng, KKH Liu, Y Wu, L |
Issue Date: | Jun-2026 | Source: | Transportation research. Part E, Logistics and transportation review, June 2026, v. 210, 104763 | Abstract: | The continuous growth in air traffic demand has strained the capacity of many hub airports. Effective runway operations are essential for optimising the utilisation of existing runways, and one of the key tasks is to manage runway operations under uncertainty. This paper examines the multi-runway aircraft landing problem (MALP) under arrival time uncertainty at hub airports with a multi-runway system, aiming to devise efficient and environmentally friendly aircraft landing operations. We model this problem using stochastic programming (SP) with a two-stage decision framework. With the support of advanced aviation technologies, air traffic control can typically make aircraft sequencing decisions based on precisely predicted arrival times. Therefore, we incorporate aircraft sequencing decisions into the second stage of the SP model. In the first stage, we assign aircraft to runways. In the second stage, we make aircraft sequencing and scheduling decisions after the arrival times are revealed. Given that the second-stage problem includes both integer and continuous variables, the model is termed the SP model with mixed-integer recourse (SP-MIR). We propose an optimisation-enhanced learning-driven scenario generation (OLSG) method, which employs machine learning techniques to estimate the distribution of unknown parameters, construct scenarios, and utilise the p-median problem to sample representative scenarios for input into the SP-MIR model. To efficiently solve the SP-MIR model, we present a novel exact decomposition approach, referred to as the stabilised branch-and-check (SBAC) method. This approach decomposes the original problem into a stabilised master problem and subproblems, wherein the master problem is stabilised around a designated stability centre to facilitate the generation of strong Benders cuts. The incorporated algorithmic enhancements further improve computational performance in solving both the stabilised master problem and subproblems. Our numerical experiment results demonstrate that the proposed SP-MIR model and OLSG method can enhance operational efficiency and reduce environmental impact in multi-runway operations for actual scenarios and real-world implementation. The results of scalability analysis indicate that the SBAC method and algorithmic enhancements achieve significant improvement in CPU time compared to well-known benchmark methods from the literature. | Keywords: | Branch-and-check Machine learning Multi-runway aircraft landing problem Prescriptive analytics Stabilisation Stochastic programming |
Publisher: | Elsevier Ltd | Journal: | Transportation research. Part E, Logistics and transportation review | ISSN: | 1366-5545 | EISSN: | 1878-5794 | DOI: | 10.1016/j.tre.2026.104763 | Rights: | © 2026 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ ). The following publication Zhang, C., Jin, Z., Ng, K. K. H., Liu, Y., & Wu, L. (2026). Stabilised branch-and-check method for optimising multi-runway aircraft landing problem modelled through stochastic programming with learning-driven arrival time predictions. Transportation Research Part E: Logistics and Transportation Review, 210, 104763 is available at https://doi.org/10.1016/j.tre.2026.104763. |
| Appears in Collections: | Journal/Magazine Article |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 1-s2.0-S1366554526001031-main.pdf | 9.39 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



