IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v195y2025ics1366554525000043.html
   My bibliography  Save this article

Predictive and prescriptive analytics for robust airport gate assignment planning in airside operations under uncertainty

Author

Listed:
  • Zhang, Chenliang
  • Jin, Zhongyi
  • Ng, Kam K.H.
  • Tang, Tie-Qiao
  • Zhang, Fangni
  • Liu, Wei

Abstract

With the increasing demand for air transport, numerous airports have exceeded their available capacity, resulting in more frequent congestion and disruptions. Therefore, airport gate assignment plans must prioritise robustness to alleviate congestion, absorb disruptions, and maintain high service levels. Given the uncertainties in airside operations, providing robust decisions is challenging. To address this issue, we employ two prescriptive analytics approaches to develop airport gate assignment plans. These approaches leverage historical data, auxiliary data, and machine learning (ML) methods to enhance decision effectiveness and robustness. Initially, we adopt a predict-then-optimise approach, utilising ML methods to predict aircraft arrival times. These predictions are then used as input for a deterministic model of the airport gate assignment problem (AGAP). Subsequently, we explore an estimate-then-optimise approach. In this approach, we first estimate the distribution of uncertain aircraft arrival times using ML methods. Then, we solve the two-stage stochastic programming model for the AGAP based on the estimated distribution. Given the complexity of the estimate-then-optimise approach, we develop an effective scenario selection strategy, the cluster-based scenario reduction (CSR) method, to maintain tractability while ensuring decision performance. Concurrently, we develop an efficient exact solution method, the Benders-based branch-and-cut (BBC) method, to effectively handle larger and more complex test instances. Numerical experiments using real-world data from Xiamen Gaoqi International Airport demonstrate the effectiveness of the CSR and BBC methods. The CSR method performs better with a smaller sample size, while the BBC method significantly enhances computational performance compared to commercial solvers. These proposed methods improve the tractability and scalability of the estimate-then-optimise approach. Notably, the estimate-then-optimise approach outperforms the predict-then-optimise approach driven by the same ML method. Furthermore, we find that estimate-then-optimise approaches, supported by well-performing ML methods and scenario selection strategies, provide superior performance compared to other optimisation approaches.

Suggested Citation

  • Zhang, Chenliang & Jin, Zhongyi & Ng, Kam K.H. & Tang, Tie-Qiao & Zhang, Fangni & Liu, Wei, 2025. "Predictive and prescriptive analytics for robust airport gate assignment planning in airside operations under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 195(C).
  • Handle: RePEc:eee:transe:v:195:y:2025:i:c:s1366554525000043
    DOI: 10.1016/j.tre.2025.103963
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2025.103963?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Daş, Gülesin Sena & Gzara, Fatma & Stützle, Thomas, 2020. "A review on airport gate assignment problems: Single versus multi objective approaches," Omega, Elsevier, vol. 92(C).
    2. Karmel S. Shehadeh, 2023. "Distributionally Robust Optimization Approaches for a Stochastic Mobile Facility Fleet Sizing, Routing, and Scheduling Problem," Transportation Science, INFORMS, vol. 57(1), pages 197-229, January.
    3. Arthur Mahéo & Philip Kilby & Pascal Van Hentenryck, 2019. "Benders Decomposition for the Design of a Hub and Shuttle Public Transit System," Service Science, INFORMS, vol. 53(1), pages 77-88, February.
    4. Nuno Antunes Ribeiro & Alexandre Jacquillat & António Pais Antunes, 2019. "A Large-Scale Neighborhood Search Approach to Airport Slot Allocation," Transportation Science, INFORMS, vol. 53(6), pages 1772-1797, November.
    5. Kim, Minsoo & Park, Taeseop & Jeong, Jaeik & Kim, Hongseok, 2023. "Stochastic optimization of home energy management system using clustered quantile scenario reduction," Applied Energy, Elsevier, vol. 349(C).
    6. Ng, K.K.H. & Lee, C.K.M. & Chan, Felix T.S. & Qin, Yichen, 2017. "Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 115-136.
    7. Yan, Ran & Yang, Dong & Wang, Tianyu & Mo, Haoyu & Wang, Shuaian, 2024. "Improving ship energy efficiency: Models, methods, and applications," Applied Energy, Elsevier, vol. 368(C).
    8. Ahmed Khassiba & Fabian Bastin & Sonia Cafieri & Bernard Gendron & Marcel Mongeau, 2020. "Two-Stage Stochastic Mixed-Integer Programming with Chance Constraints for Extended Aircraft Arrival Management," Transportation Science, INFORMS, vol. 54(4), pages 897-919, July.
    9. Kim, Junyoung & Goo, Byungju & Roh, Youngjoo & Lee, Chungmok & Lee, Kyungsik, 2023. "A branch-and-price approach for airport gate assignment problem with chance constraints," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 1-26.
    10. Pohl, Maximilian & Kolisch, Rainer & Schiffer, Maximilian, 2021. "Runway scheduling during winter operations," Omega, Elsevier, vol. 102(C).
    11. Walter Rei & Jean-François Cordeau & Michel Gendreau & Patrick Soriano, 2009. "Accelerating Benders Decomposition by Local Branching," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 333-345, May.
    12. Lingxiao Wu & Yossiri Adulyasak & Jean-François Cordeau & Shuaian Wang, 2022. "Vessel Service Planning in Seaports," Operations Research, INFORMS, vol. 70(4), pages 2032-2053, July.
    13. A Bolat, 2001. "Models and a genetic algorithm for static aircraft-gate assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(10), pages 1107-1120, October.
    14. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    15. Gendron, Bernard & Scutellà, Maria Grazia & Garroppo, Rosario G. & Nencioni, Gianfranco & Tavanti, Luca, 2016. "A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks," European Journal of Operational Research, Elsevier, vol. 255(1), pages 151-162.
    16. Julien Keutchayan & Janosch Ortmann & Walter Rei, 2023. "Problem-driven scenario clustering in stochastic optimization," Computational Management Science, Springer, vol. 20(1), pages 1-33, December.
    17. Tian, Xuecheng & Yan, Ran & Liu, Yannick & Wang, Shuaian, 2023. "A smart predict-then-optimize method for targeted and cost-effective maritime transportation," Transportation Research Part B: Methodological, Elsevier, vol. 172(C), pages 32-52.
    18. Karsu, Özlem & Azizoğlu, Meral & Alanlı, Kerem, 2021. "Exact and heuristic solution approaches for the airport gate assignment problem," Omega, Elsevier, vol. 103(C).
    19. Chen, Shuiwang & Wu, Lingxiao & Ng, Kam K.H. & Liu, Wei & Wang, Kun, 2024. "How airports enhance the environmental sustainability of operations: A critical review from the perspective of Operations Research," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    20. Wang, Shuaian & Yan, Ran, 2023. "Fundamental challenge and solution methods in prescriptive analytics for freight transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    21. Wang, Zhengyi & Liang, Man & Delahaye, Daniel, 2020. "Automated data-driven prediction on aircraft Estimated Time of Arrival," Journal of Air Transport Management, Elsevier, vol. 88(C).
    22. Zhang, Dong & Klabjan, Diego, 2017. "Optimization for gate re-assignment," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 260-284.
    23. Xu, Liang & Zhang, Chao & Xiao, Feng & Wang, Fan, 2017. "A robust approach to airport gate assignment with a solution-dependent uncertainty budget," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 458-478.
    24. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2012. "Flight gate scheduling with respect to a reference schedule," Annals of Operations Research, Springer, vol. 194(1), pages 177-187, April.
    25. Dimitris Bertsimas & Nathan Kallus, 2020. "From Predictive to Prescriptive Analytics," Management Science, INFORMS, vol. 66(3), pages 1025-1044, March.
    26. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2015. "Benders Decomposition for Production Routing Under Demand Uncertainty," Operations Research, INFORMS, vol. 63(4), pages 851-867, August.
    27. Şeker, Merve & Noyan, Nilay, 2012. "Stochastic optimization models for the airport gate assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 438-459.
    28. Jiang, Yu & Wang, Yasha & Hu, Zhitao & Xue, Qingwen & Yu, Bin, 2023. "Airport gate assignment problem with harbor constraints based on Branch-and-Price algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 176(C).
    29. Yan, Ran & Wang, Shuaian & Du, Yuquan, 2020. "Development of a two-stage ship fuel consumption prediction and reduction model for a dry bulk ship," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    30. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2017. "Flight gate assignment and recovery strategies with stochastic arrival and departure times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 65-93, January.
    31. Senay Solak & Gustaf Solveling & John-Paul B. Clarke & Ellis L. Johnson, 2018. "Stochastic Runway Scheduling," Transportation Science, INFORMS, vol. 52(4), pages 917-940, August.
    32. Leonardo Galli & Tommaso Levato & Fabio Schoen & Luca Tigli, 2021. "Prescriptive analytics for inventory management in health care," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(10), pages 2211-2224, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wandelt, Sebastian & Signori, Andrea & Chang, Shuming & Wang, Shuang & Du, Zhuoming & Sun, Xiaoqian, 2025. "Unleashing the potential of operations research in air transport: A review of applications, methods, and challenges," Journal of Air Transport Management, Elsevier, vol. 124(C).
    2. Yin, Suwan & Han, Ke & Ochieng, Washington Yotto & Sanchez, Daniel Regueiro, 2022. "Joint apron-runway assignment for airport surface operations," Transportation Research Part B: Methodological, Elsevier, vol. 156(C), pages 76-100.
    3. Chen, Shuiwang & Wu, Lingxiao & Ng, Kam K.H. & Liu, Wei & Wang, Kun, 2024. "How airports enhance the environmental sustainability of operations: A critical review from the perspective of Operations Research," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    4. Daş, Gülesin Sena & Gzara, Fatma & Stützle, Thomas, 2020. "A review on airport gate assignment problems: Single versus multi objective approaches," Omega, Elsevier, vol. 92(C).
    5. Bert Dijk & Bruno F. Santos & Joao P. Pita, 2019. "The recoverable robust stand allocation problem: a GRU airport case study," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 615-639, September.
    6. Li, Mingjie & Hao, Jin-Kao & Wu, Qinghua, 2022. "Learning-driven feasible and infeasible tabu search for airport gate assignment," European Journal of Operational Research, Elsevier, vol. 302(1), pages 172-186.
    7. Kim, Junyoung & Goo, Byungju & Roh, Youngjoo & Lee, Chungmok & Lee, Kyungsik, 2023. "A branch-and-price approach for airport gate assignment problem with chance constraints," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 1-26.
    8. Poyraz, Dursen Deniz & AzizoÄŸlu, Meral, 2024. "An airport gate reassignment problem with gate closures," Journal of Air Transport Management, Elsevier, vol. 115(C).
    9. Hagspihl, Thomas & Kolisch, Rainer & Fontaine, Pirmin & Schiffels, Sebastian, 2024. "Apron layout planning–Optimal positioning of aircraft stands," Transportation Research Part B: Methodological, Elsevier, vol. 179(C).
    10. Ragheb Rahmaniani & Shabbir Ahmed & Teodor Gabriel Crainic & Michel Gendreau & Walter Rei, 2020. "The Benders Dual Decomposition Method," Operations Research, INFORMS, vol. 68(3), pages 878-895, May.
    11. Pavlo Glushko & Csaba I. Fábián & Achim Koberstein, 2022. "An L-shaped method with strengthened lift-and-project cuts," Computational Management Science, Springer, vol. 19(4), pages 539-565, October.
    12. Teodor Gabriel Crainic & Mike Hewitt & Francesca Maggioni & Walter Rei, 2021. "Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design," Transportation Science, INFORMS, vol. 55(2), pages 414-435, March.
    13. Kumar, Pramesh & Khani, Alireza, 2022. "Planning of integrated mobility-on-demand and urban transit networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 166(C), pages 499-521.
    14. Xu, Liang & Zhang, Chao & Xiao, Feng & Wang, Fan, 2017. "A robust approach to airport gate assignment with a solution-dependent uncertainty budget," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 458-478.
    15. Gülesin Sena Daş & Fatma Gzara, 2024. "Column generation based solution for bi-objective gate assignment problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(1), pages 123-151, August.
    16. Belieres, Simon & Hewitt, Mike & Jozefowiez, Nicolas & Semet, Frédéric, 2022. "Meta partial benders decomposition for the logistics service network design problem," European Journal of Operational Research, Elsevier, vol. 300(2), pages 473-489.
    17. Wei Zhang & Kai Wang & Alexandre Jacquillat & Shuaian Wang, 2023. "Optimized Scenario Reduction: Solving Large-Scale Stochastic Programs with Quality Guarantees," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 886-908, July.
    18. Karsu, Özlem & Azizoğlu, Meral & Alanlı, Kerem, 2021. "Exact and heuristic solution approaches for the airport gate assignment problem," Omega, Elsevier, vol. 103(C).
    19. Skorupski, Jacek & Żarów, Piotr, 2021. "Dynamic management of aircraft stand allocation," Journal of Air Transport Management, Elsevier, vol. 90(C).
    20. Kiho Seo & Seulgi Joung & Chungmok Lee & Sungsoo Park, 2022. "A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2804-2827, September.

    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:195:y:2025:i:c:s1366554525000043. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.