IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v175y2020icp179-191.html
   My bibliography  Save this article

An algorithm for single- and multiple-runway aircraft landing problem

Author

Listed:
  • Salehipour, Amir

Abstract

The aircraft landing problem (ALP) is the problem of allocating an airport’s runways to arriving aircraft as well as scheduling the landing time of aircraft, with the objective of minimizing the total deviation from the target landing times. We propose a simple heuristic to solve ALP. The distinguishing factor of the proposed algorithm includes decomposing the problem into a chain of smaller and easier-to-solve problems. We show that utilizing this strategy is very effective in solving the problem in a short time. Our work is motivated by the dynamic nature of the problem, i.e., due to the continuous changes in the number of arriving flights and a short window for determining the landing schedule, the air traffic controller needs to solve the problem on a regular basis and update the landing schedule, and fast and effective algorithms are therefore paramount. By solving two sets of 124 benchmark instances we demonstrate that we fulfill this aim and that the proposed algorithm obtains satisfactory solutions in a short amount of time.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:matcom:v:175:y:2020:i:c:p:179-191
    DOI: 10.1016/j.matcom.2019.10.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037847541930309X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2019.10.006?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. L. Bianco & P. Dell'Olmo & S. Giordani, 1999. "Minimizing total completion time subject to release dates and sequence‐dependentprocessing times," Annals of Operations Research, Springer, vol. 86(0), pages 393-415, January.
    2. 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.
    3. Sabar, Nasser R. & Kendall, Graham, 2015. "An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem," Omega, Elsevier, vol. 56(C), pages 88-98.
    4. 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.
    5. Vadlamani, Satish & Hosseini, Seyedmohsen, 2014. "A novel heuristic approach for solving aircraft landing problem with single runway," Journal of Air Transport Management, Elsevier, vol. 40(C), pages 144-148.
    6. J. E. Beasley & M. Krishnamoorthy & Y. M. Sharaiha & D. Abramson, 2000. "Scheduling Aircraft Landings—The Static Case," Transportation Science, INFORMS, vol. 34(2), pages 180-197, May.
    7. 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.
    8. 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. Pohl, Maximilian & Kolisch, Rainer & Schiffer, Maximilian, 2021. "Runway scheduling during winter operations," Omega, Elsevier, vol. 102(C).
    2. 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.
    3. 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.
    4. 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.
    5. 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).
    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. 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.
    9. Jason A. D. Atkin & Geert De Maere & Edmund K. Burke & John S. Greenwood, 2013. "Addressing the Pushback Time Allocation Problem at Heathrow Airport," Transportation Science, INFORMS, vol. 47(4), pages 584-602, November.
    10. Ahmed Ghoniem & Hanif D. Sherali & Hojong Baik, 2014. "Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 514-530, August.
    11. Daniel Karapetyan & Jason A. D. Atkin & Andrew J. Parkes & Juan Castro-Gutierrez, 2017. "Lessons from building an automated pre-departure sequencer for airports," Annals of Operations Research, Springer, vol. 252(2), pages 435-453, May.
    12. Jianan Yin & Yuanyuan Ma & Yuxin Hu & Ke Han & Suwan Yin & Hua Xie, 2021. "Delay, Throughput and Emission Tradeoffs in Airport Runway Scheduling with Uncertainty Considerations," Networks and Spatial Economics, Springer, vol. 21(1), pages 85-122, March.
    13. 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.
    14. 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.
    15. 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.
    16. Julia Bennell & Mohammad Mesgarpour & Chris Potts, 2013. "Airport runway scheduling," Annals of Operations Research, Springer, vol. 204(1), pages 249-270, April.
    17. Geert De Maere & Jason A. D. Atkin & Edmund K. Burke, 2018. "Pruning Rules for Optimal Runway Sequencing," Transportation Science, INFORMS, vol. 52(4), pages 898-916, August.
    18. 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.
    19. Guépet, Julien & Briant, Olivier & Gayon, Jean-Philippe & Acuna-Agost, Rodrigo, 2017. "Integration of aircraft ground movements and runway operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 104(C), pages 131-149.
    20. Jason A. D. Atkin & Edmund K. Burke & John S. Greenwood & Dale Reeson, 2009. "An examination of take-off scheduling constraints at London Heathrow airport," Public Transport, Springer, vol. 1(3), pages 169-187, August.

    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:matcom:v:175:y:2020:i:c:p:179-191. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.