Skip to main content
SpringerLink
Log in

A Tabu Search Algorithm for the Multiple Runway Aircraft Scheduling Problem

  • Chapter
  • First Online:
Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 236))

Abstract

Runways are typically identified as the primary bottleneck of the airport operations system that causes delays. Hence, operational efficiency of runways constitutes a critical factor for the overall air transportation system. Multiple Runway Aircraft Scheduling Problem involves assigning both landing and taking-off aircraft to runways, sequencing them on each runway and assigning each aircraft a landing or take-off time while considering predetermined time windows for each aircraft to land or take-off. Also, sequence-dependent separation times between each aircraft pair in the sequence need to be taken into account in order to avoid wake vortex (turbulence) effects which can pose a hazard caused by preceding aircraft. Several variations of this combinatorial optimization problem are researched extensively in the past decades and a wide variety of algorithms have been proposed for small-scale problems. However, from a practical point of view large-scale real-life problems require fast response times and remain challenging computationally. This chapter aims to present a Tabu Search (TS) algorithm for the static (offline) case of the problem, where all information of aircraft is known in advance. Also, computational results for the proposed algorithm are presented for a number of benchmark instances obtained from literature.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Abela J, Abramson D, Krishnamoorthy M, De Silva A, Mills G (1993) Computing optimal schedules for landing aircraft. Paper presented at the proceedings of the 12th national conference of the Australian Society for Operations Research, Adelaide

    Google Scholar 

  • Al-Salem A, Farhadi F, Kharbeche M, Ghoniem A (2012) Multiple-runway aircraft sequencing problems using mixed-integer programming. In: Proceedings of the IIE annual conference, January 2012. Institute of Industrial Engineers, Chicago, p 1

    Google Scholar 

  • Artiouchine K, Baptiste P, Dürr C (2008) Runway sequencing with holding patterns. Eur J Oper Res 189(3):1254–1266

    Article  Google Scholar 

  • Atkin JA, Burke EK, Greenwood JS, Reeson D (2007) Hybrid metaheuristics to aid runway scheduling at London Heathrow airport. Transp Sci 41(1):90–106

    Article  Google Scholar 

  • Atkin JA, Burke EK, Greenwood JS, Reeson D (2008) A metaheuristic approach to aircraft departure scheduling at London Heathrow airport computer-aided systems in public transport. Springer, Heidelberg, pp 235–252

    Google Scholar 

  • Barnes J, Laguna M (1991) A review and synthesis of tabu search applications to production scheduling problems. Technical Report ORP91-05, University of Texas at Austin

    Google Scholar 

  • Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41:1069–1072

    Article  Google Scholar 

  • Beasley JE, Krishnamoorthy M, Sharaiha YM, Abramson D (2000) Scheduling aircraft landings—the static case. Transp Sci 34(2):180–197

    Article  Google Scholar 

  • Bencheikh G, Boukachour J, Alaoui AEH, Khoukhi F (2009) Hybrid method for aircraft landing scheduling based on a job shop formulation. Int J Comput Sci Netw Secur 9(8):78–88

    Google Scholar 

  • Bennell JA, Mesgarpour M, Potts CN (2011) Airport runway scheduling. 4OR 9(2):115–138; Ann Oper Res 204(1):249–270

    Google Scholar 

  • Bianco L, Dell’Olmo P, Giordani S (2006) Scheduling models for air traffic control in terminal areas. J Sched 9(3):223–253

    Article  Google Scholar 

  • Capr S, Ignaccolo M (2004) Genetic algorithms for solving the aircraft-sequencing problem: the introduction of departures into the dynamic model. J Air Transp Manag 10(5):345–351

    Article  Google Scholar 

  • Cheng VHL, Crawford LS, Menon PK (1999) Air traffic control using genetic search techniques. In: Proceedings of the 1999 IEEE international conference on control applications, vol 1. IEEE, New York, pp 249–254

    Google Scholar 

  • Ciesielski V, Scerri P (1998) Real time genetic scheduling of aircraft landing times. In: Evolutionary computation proceedings of the 1998 IEEE international conference on IEEE world congress on computational intelligence, May 1998. IEEE, New York, pp 360–364

    Google Scholar 

  • Ernst AT, Krishnamoorthy M, Storer RH (1999) Heuristic and exact algorithms for scheduling aircraft landings. Networks 34(3):229–241

    Article  Google Scholar 

  • Faye A (2015) Solving the aircraft landing problem with time discretization approach. Eur J Oper Res 242(3):1028–1038. doi:10.1016/j.ejor.2014.10.064

    Article  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco, CA

    Google Scholar 

  • Ghoniem A, Farhadi F, Reihaneh M (2015) An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems. Eur J Oper Res 246:34–43

    Article  Google Scholar 

  • Glover F (1989) Tabu search-part I. ORSA J Comput 1(3):190–206

    Article  Google Scholar 

  • Glover F (1990) Tabu search—part II. ORSA J Comput 2(1):4–32

    Article  Google Scholar 

  • Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326

    Article  Google Scholar 

  • Hancerliogullari G, Rabadi G, Al-Salem AH, Kharbeche M (2013) Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem. J Air Transp Manag 32:39–48. doi:10.1016/j.jairtraman.2013.06.001

    Article  Google Scholar 

  • Laguna M, Glover F (1993) Integrating target analysis and tabu search for improved scheduling systems. Expert Syst Appl 6(3):287–297

    Article  Google Scholar 

  • Liu Y-H (2011) A genetic local search algorithm with a threshold accepting mechanism for solving the runway dependent aircraft landing problem. Optim Lett 5(2):229–245. doi:10.1007/s11590-010-0203-0

    Article  Google Scholar 

  • Pinol H, Beasley JE (2006) Scatter search and bionomic algorithms for the aircraft landing problem. Eur J Oper Res 171(2):439–462

    Article  Google Scholar 

  • Soomer MJ, Franx GJ (2008) Scheduling aircraft landings using airlines’ preferences. Eur J Oper Res 190(1):277–291. doi:10.1016/j.ejor.2007.06.017

    Article  Google Scholar 

  • Wen M, Larsen J, Clausen J (2005) An exact algorithm for aircraft landing problem. IMM-Technical Report-2005-12, Informatics and Mathematical Modelling, Technical University of Denmark

    Google Scholar 

  • Xiao-rong F, Xing-jie F, Rui Z (2014) Using the heuristic genetic algorithm in multi-runway aircraft landing scheduling. TELKOMNIKA Indones J Electr Eng 12(3):2203–2211

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Engineering Management and Systems Engineering, Old Dominion University, Engineering Systems Building, Rm 2102, Norfolk, Virginia, 23529, USA

    Bulent Soykan & Ghaith Rabadi

Authors
  1. Bulent Soykan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ghaith Rabadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ghaith Rabadi .

Editor information

Editors and Affiliations

  1. Engineering Management and Systems Eng., Old Dominion University, NORFOLK, Virginia, USA

    Ghaith Rabadi

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Soykan, B., Rabadi, G. (2016). A Tabu Search Algorithm for the Multiple Runway Aircraft Scheduling Problem. In: Rabadi, G. (eds) Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling. International Series in Operations Research & Management Science, vol 236. Springer, Cham. https://doi.org/10.1007/978-3-319-26024-2_9

Download citation

Publish with us

Policies and ethics

Search

Navigation