IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v344y2025i1d10.1007_s10479-024-06358-x.html
   My bibliography  Save this article

A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes

Author

Listed:
  • Bin Cao

    (Jinan University)

  • Chao Xu

    (University of Electronic Science and Technology of China)

Abstract

The aircraft landing problem (ALP) is an important issue of assigning an airport’s runways to the arrival aircrafts as well as to schedule the landing time of these aircrafts in practice. A large number of the extant studies have tried to address such a practical problem with using various algorithms for one or more runways. For a static single-runway of the ALP, this paper proposes a new approach to develop an alternative powerful algorithm. For a given sequence of planes, we develop a faster algorithm for solving the ALP with the running time $$O(n \log n)$$ O ( n log n ) , where n is the number of aircrafts in the schedule. Alternatively, we reduce the proposed problem of minimizing the total cost by determining the landing times for a given landing sequence into a min-cost flow problem. We conduct a set of experimental studies to compare the performance of our near-linear time algorithm to the quadratic time algorithm whose time complexity is $$O(n^2)$$ O ( n 2 ) , for computing the optimal landing times. The computational results show that the proposed heuristic based on our algorithm could be much faster than both such quadratic time algorithm and the one using linear programming.

Suggested Citation

  • Bin Cao & Chao Xu, 2025. "A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes," Annals of Operations Research, Springer, vol. 344(1), pages 479-498, January.
    • Handle: RePEc:spr:annopr:v:344:y:2025:i:1:d:10.1007_s10479-024-06358-x
    DOI: 10.1007/s10479-024-06358-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-024-06358-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-024-06358-x?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. Julia Bennell & Mohammad Mesgarpour & Chris Potts, 2013. "Airport runway scheduling," Annals of Operations Research, Springer, vol. 204(1), pages 249-270, April.
    2. Lieder, Alexander & Briskorn, Dirk & Stolletz, Raik, 2015. "A dynamic programming approach for the aircraft landing problem with aircraft classes," European Journal of Operational Research, Elsevier, vol. 243(1), pages 61-69.
    3. J E Beasley & M Krishnamoorthy & Y M Sharaiha & D Abramson, 2004. "Displacement problem and dynamically scheduling aircraft landings," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(1), pages 54-64, January.
    4. Faye, Alain, 2015. "Solving the Aircraft Landing Problem with time discretization approach," European Journal of Operational Research, Elsevier, vol. 242(3), pages 1028-1038.
    5. Ghoniem, Ahmed & Farhadi, Farbod & Reihaneh, Mohammad, 2015. "An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems," European Journal of Operational Research, Elsevier, vol. 246(1), pages 34-43.
    6. Hamsa Balakrishnan & Bala G. Chandran, 2010. "Algorithms for Scheduling Runway Operations Under Constrained Position Shifting," Operations Research, INFORMS, vol. 58(6), pages 1650-1665, December.
    7. Harilaos N. Psaraftis, 1980. "A Dynamic Programming Approach for Sequencing Groups of Identical Jobs," Operations Research, INFORMS, vol. 28(6), pages 1347-1359, December.
    8. Jason Atkin & Han Hoogeveen & Raik Stolletz, 2019. "Airport operations management," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 613-614, September.
    9. Soomer, M.J. & Franx, G.J., 2008. "Scheduling aircraft landings using airlines' preferences," European Journal of Operational Research, Elsevier, vol. 190(1), pages 277-291, October.
    10. Marcella Samà & Andrea D’Ariano & Konstantin Palagachev & Matthias Gerdts, 2019. "Integration methods for aircraft scheduling and trajectory optimization at a busy terminal manoeuvring area," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 641-681, September.
    11. Bennell, Julia A. & Mesgarpour, Mohammad & Potts, Chris N., 2017. "Dynamic scheduling of aircraft landings," European Journal of Operational Research, Elsevier, vol. 258(1), pages 315-327.
    12. J E Beasley & J Sonander & P Havelock, 2001. "Scheduling aircraft landings at London Heathrow using a population heuristic," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(5), pages 483-493, May.
    13. Hancerliogullari, Gulsah & Rabadi, Ghaith & Al-Salem, Ameer H. & Kharbeche, Mohamed, 2013. "Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem," Journal of Air Transport Management, Elsevier, vol. 32(C), pages 39-48.
    14. Pinol, H. & Beasley, J.E., 2006. "Scatter Search and Bionomic Algorithms for the aircraft landing problem," European Journal of Operational Research, Elsevier, vol. 171(2), pages 439-462, June.
    15. Faye, Alain, 2018. "A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes," European Journal of Operational Research, Elsevier, vol. 270(3), pages 1148-1157.
    16. Ahmed Ghoniem & Farbod Farhadi, 2015. "A column generation approach for aircraft sequencing problems: a computational study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(10), pages 1717-1729, 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. Lieder, Alexander & Stolletz, Raik, 2016. "Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 167-188.
    2. Pohl, Maximilian & Kolisch, Rainer & Schiffer, Maximilian, 2021. "Runway scheduling during winter operations," Omega, Elsevier, vol. 102(C).
    3. Marie-Sklaerder Vié & Nicolas Zufferey & Roel Leus, 2022. "Aircraft landing planning under uncertain conditions," Journal of Scheduling, Springer, vol. 25(2), pages 203-228, April.
    4. Lieder, Alexander & Briskorn, Dirk & Stolletz, Raik, 2015. "A dynamic programming approach for the aircraft landing problem with aircraft classes," European Journal of Operational Research, Elsevier, vol. 243(1), pages 61-69.
    5. Pohl, Maximilian & Artigues, Christian & Kolisch, Rainer, 2022. "Solving the time-discrete winter runway scheduling problem: A column generation and constraint programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 674-689.
    6. Bo Xu & Weimin Ma & Hui Huang & Lei Yue, 2016. "Weighted Constrained Position Shift Model for Aircraft Arrival Sequencing and Scheduling Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-22, August.
    7. Zhang, Junfeng & Zhao, Pengli & Zhang, Yu & Dai, Ximei & Sui, Dong, 2020. "Criteria selection and multi-objective optimization of aircraft landing problem," Journal of Air Transport Management, Elsevier, vol. 82(C).
    8. 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.
    9. Bennell, Julia A. & Mesgarpour, Mohammad & Potts, Chris N., 2017. "Dynamic scheduling of aircraft landings," European Journal of Operational Research, Elsevier, vol. 258(1), pages 315-327.
    10. Chandra, Aitichya & Choubey, Nipun & Verma, Ashish & Sooraj, K.P., 2024. "Quasi-stochastic optimization model for time-based arrival scheduling considering Standard Terminal Arrival (STAR) track time and a new delay-conflict relationship," Journal of Air Transport Management, Elsevier, vol. 115(C).
    11. Rakesh Prakash & Jitamitra Desai & Rajesh Piplani, 2022. "An optimal data-splitting algorithm for aircraft sequencing on a single runway," Annals of Operations Research, Springer, vol. 309(2), pages 587-610, February.
    12. Dönmez, Kadir & Çetek, Cem & Kaya, Onur, 2022. "Air traffic management in parallel-point merge systems under wind uncertainties," Journal of Air Transport Management, Elsevier, vol. 104(C).
    13. Samà, Marcella & D’Ariano, Andrea & D’Ariano, Paolo & Pacciarelli, Dario, 2017. "Scheduling models for optimal aircraft traffic control at busy airports: Tardiness, priorities, equity and violations considerations," Omega, Elsevier, vol. 67(C), pages 81-98.
    14. Marcella Samà & Andrea D’Ariano & Konstantin Palagachev & Matthias Gerdts, 2019. "Integration methods for aircraft scheduling and trajectory optimization at a busy terminal manoeuvring area," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 641-681, September.
    15. Julia Bennell & Mohammad Mesgarpour & Chris Potts, 2013. "Airport runway scheduling," Annals of Operations Research, Springer, vol. 204(1), pages 249-270, April.
    16. Ghoniem, Ahmed & Farhadi, Farbod & Reihaneh, Mohammad, 2015. "An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems," European Journal of Operational Research, Elsevier, vol. 246(1), pages 34-43.
    17. Hancerliogullari, Gulsah & Rabadi, Ghaith & Al-Salem, Ameer H. & Kharbeche, Mohamed, 2013. "Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem," Journal of Air Transport Management, Elsevier, vol. 32(C), pages 39-48.
    18. Faye, Alain, 2015. "Solving the Aircraft Landing Problem with time discretization approach," European Journal of Operational Research, Elsevier, vol. 242(3), pages 1028-1038.
    19. Salehipour, Amir, 2020. "An algorithm for single- and multiple-runway aircraft landing problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 175(C), pages 179-191.
    20. A R Brentnall & R C H Cheng, 2009. "Some effects of aircraft arrival sequence algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 962-972, July.

    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:spr:annopr:v:344:y:2025:i:1:d:10.1007_s10479-024-06358-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.