IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v210y2026ics1366554526001031.html

Stabilised branch-and-check method for optimising multi-runway aircraft landing problem modelled through stochastic programming with learning-driven arrival time predictions

Author

Listed:
  • Zhang, Chenliang
  • Jin, Zhongyi
  • Ng, Kam K.H.
  • Liu, Ye
  • Wu, Lingxiao

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.

Suggested Citation

  • Zhang, Chenliang & Jin, Zhongyi & Ng, Kam K.H. & Liu, Ye & Wu, Lingxiao, 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, Elsevier, vol. 210(C).
  • Handle: RePEc:eee:transe:v:210:y:2026:i:c:s1366554526001031
    DOI: 10.1016/j.tre.2026.104763
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554526001031
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2026.104763?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:210:y:2026:i:c:s1366554526001031. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.