Skip to main content
SpringerLink
Log in

ISA: a hybridization between iterated local search and simulated annealing for multiple-runway aircraft landing problem

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

This paper presents an efficient method for aircraft landing problem (ALP) based on a mechanism that hybridizes the iterated local search (ILS) and simulated annealing (SA) algorithms. ALP is handled by scheduling each incoming aircraft to land on a runway in accordance with a predefined landing time frame. The main objective to address is to find a feasible aircraft scheduling solution within the range of target time. The proposed hybridization method complements the advantages of both ILS and SA in a single optimization framework, referred to as iterated simulated annealing (ISA). The optimization framework of ISA has two main loops: an inner loop and an outer loop. In the inner loop, SA is utilized through a cooling schedule and a relaxing acceptance strategy to allow ISA to escape the local optima. In the outer loop, the restart mechanism and perturbation operation of the standard ILS are used to empower ISA to broadly navigate different search space regions. Extensive evaluation experiments were conducted on thirteen small- and large-sized ALP instances to assess the effectiveness and solution quality of ISA. The obtained results confirm that the proposed ISA method considerably performs better than other state-of-the-art methods in which ISA is capable of reaching new best results in 4 out of 24 large-sized problem instances as well as obtaining the best results in all small-sized instances. Evaluation on large-sized instances confirms a high degree of performance. As a new line of research, ISA is an effective method for ALP which can be further investigated for other combinatorial optimization problems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/airlandinfo.html.

References

  1. Bennell JA, Mesgarpour M, Potts CN (2011) Airport runway scheduling. 4OR 9(2):115

    Article  MathSciNet  MATH  Google Scholar 

  2. Faye A (2015) Solving the aircraft landing problem with time discretization approach. Eur J Oper Res 242(3):1028–1038

    Article  MathSciNet  MATH  Google Scholar 

  3. Girish BS (2016) An efficient hybrid particle swarm optimization algorithm in a rolling horizon framework for the aircraft landing problem. Appl Soft Comput 44:200–221

    Article  Google Scholar 

  4. Briskorn D, Stolletz R (2014) Aircraft landing problems with aircraft classes. J Sched 17(1):31–45

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  6. Beasley JE, Krishnamoorthy M, Sharaiha YM, Abramson D (2004) Displacement problem and dynamically scheduling aircraft landings. J Oper Res Soc 55(1):54–64

    Article  MATH  Google Scholar 

  7. Lieder A, Briskorn D, Stolletz R (2015) A dynamic programming approach for the aircraft landing problem with aircraft classes. Eur J Oper Res 243(1):61–69

    Article  MathSciNet  MATH  Google Scholar 

  8. Lieder A, Stolletz R (2016) Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways. Transp Res Part E Logist Transp Rev 88(Supplement C):167–188

    Article  Google Scholar 

  9. Salehipour A, Modarres M, Naeni LM (2013) An efficient hybrid meta-heuristic for aircraft landing problem. Comput Oper Res 40(1):207–213

    Article  MathSciNet  MATH  Google Scholar 

  10. Furini F, Kidd MP, Persiani CA, Toth P (2015) Improved rolling horizon approaches to the aircraft sequencing problem. J Sched 18(5):435–447

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  12. Awasthi A, Kramer O, Lassig J (2013) Aircraft landing problem: an efficient algorithm for a given landing sequence. In: 2013 IEEE 16th international conference on computational science and engineering, pp 20–27

  13. DÁpice C, De Nicola C, Manzo R, Moccia V (2014) Optimal scheduling for aircraft departures. J Ambient Intell Humani Comput 5(6):799–807

  14. Farhadi F (2016) Heuristics and meta-heuristics for runway scheduling problems. In: Rabadi G (ed) Heuristics, metaheuristics and approximate methods in planning and scheduling. Springer International Publishing, Switzerland, pp 141–163

    Google Scholar 

  15. Osman IH, Laporte G (1996) Metaheuristics: a bibliography. Ann Oper Res 63(5):511–623

    Article  MATH  Google Scholar 

  16. Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv: CSUR 35(3):268–308

    Article  Google Scholar 

  17. Črepinšek M, Liu S-H, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv 45(3):35:1–35:33

    Article  MATH  Google Scholar 

  18. Capri 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 

  19. Xiao-Bing H, Chen W-H (2005) Genetic algorithm based on receding horizon control for arrival sequencing and scheduling. Eng Appl Artif Intell 18(5):633–642

    Article  Google Scholar 

  20. Beasley JE, Sonander J, Havelock P (2001) Scheduling aircraft landings at London Heathrow using a population heuristic. J Oper Res Soc 52:483–493

    Article  MATH  Google Scholar 

  21. Farah I, Kansou A, Yassine A, Galinho T (2011) Ant colony optimization for aircraft landings. In: 2011 4th international conference on logistics, pp 235–240

  22. Ma W, Bo X, Liu M, Huang H (2014) An efficient approximation algorithm for aircraft arrival sequencing and scheduling problem. Math Probl Eng 2014:1–8

    MathSciNet  MATH  Google Scholar 

  23. Ng KKH, Lee CKM, Chan FTS, Qin Y (2017) Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min–max regret approach. Transp Res Part E Logist Transp Rev 106:115–136

    Article  Google Scholar 

  24. Dastgerdi K, Mehrshad N, Farshad M (2016) A new intelligent approach for air traffic control using gravitational search algorithm. Sadhana 41(2):183–191

    Article  MathSciNet  MATH  Google Scholar 

  25. Al-Betar MA, Khader AT, Doush IA (2014) Memetic techniques for examination timetabling. Ann OR 218(1):23–50

    Article  MathSciNet  MATH  Google Scholar 

  26. Van Laarhoven PJM, Aarts EHL (eds) (1987) Simulated annealing. In: Simulated annealing: theory and applications. Springer, Netherlands pp 7–15

  27. Sabar NR, Kendall G (2015) An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem. Omega 56:88–98

    Article  Google Scholar 

  28. Martin OC, Otto SW (1996) Combining simulated annealing with local search heuristics. Ann Oper Res 63(1):57–75

    Article  MathSciNet  MATH  Google Scholar 

  29. Rajalakshmi K, Kumar P, Bindu HM (2010) Hybridizing iterative local search algorithm for assigning cells to switch in cellular mobile network. Int J Soft Comput 5(1):7–12

    Article  Google Scholar 

  30. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82

    Article  Google Scholar 

  31. Stútzle T (2006) Iterated local search for the quadratic assignment problem. Eur J Oper Res 174(3):1519–1539

    Article  MathSciNet  MATH  Google Scholar 

  32. Kirkpatrick S, Gelatt CD, Vecchi MP et al (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  34. García S, Fernández A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inf Sci 180(10):2044–2064

    Article  Google Scholar 

  35. Al-Betar MA, Khader AT (2012) A harmony search algorithm for university course timetabling. Ann Oper Res 194(1):3–31

    Article  MathSciNet  MATH  Google Scholar 

  36. Al-Betar MA, Khader AT, Doush IA (2014) Memetic techniques for examination timetabling. Ann Oper Res 218(1):23–50

    Article  MathSciNet  MATH  Google Scholar 

  37. Awadallah MA, Bolaji AL, Al-Betar MA (2015) A hybrid artificial bee colony for a nurse rostering problem. Appl Soft Comput 35:726–739

    Article  Google Scholar 

  38. Alsukni E, Arabeyyat OS, Awadallah MA, Alsamarraie L, Abu-Doush I, Al-Betar MA (2019) Multiple-reservoir scheduling using \(\beta \)-hill climbing algorithm. J Intell Syst 28(4):559–570

    Article  Google Scholar 

  39. Hammouri AI, Alrifai B (2014) Investigating biogeography-based optimisation for patient admission scheduling problems. J Theor Appl Inf Technol 70(3):413–421

    Google Scholar 

  40. Sheta A, Faris H, Braik M, Mirjalili S (2020) Nature-inspired metaheuristics search algorithms for solving the economic load dispatch problem of power system: a comparison study. In: Dey N, Ashour AS, Bhattacharyya S (eds) Applied nature-inspired computing: algorithms and case studies. Springer, Singapore, pp 199–230

    Chapter  Google Scholar 

  41. Hammouri AI, Samra ETA, Al-Betar MA, Khalil RM, Alasmer Z, Kanan M (2018) A dragonfly algorithm for solving traveling salesman problem. In: 2018 8th IEEE international conference on control system, computing and engineering (ICCSCE). IEEE, pp 136–141

  42. Glover F (1990) Tabu search: a tutorial. Interfaces 20(4):74–94

    Article  Google Scholar 

  43. Resende MGC, Velarde JLG (2003) Grasp: Greedy randomized adaptive search procedures. Intel Artif Rev Iberoam Intel Artif 19(1):61–76

    Google Scholar 

  44. Al-Betar MA (2017) \(\beta \)-hill climbing: an exploratory local search. Neural Comput Appl 28(1):153–168

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Information Systems, Al-Balqa Applied University, Al-Salt, 19117, Jordan

    Abdelaziz I. Hammouri

  2. Department of Computer Science, Al-Balqa Applied University, Al-Salt, 19117, Jordan

    Malik Sh. Braik

  3. Department of Information Technology, Al-Huson University College, Al-Balqa Applied University, P.O. Box 50, Al-Huson, Irbid, Jordan

    Mohammed Azmi Al-Betar

  4. Department of Computer Science, Al-Aqsa University, P.O. Box 4051, Gaza, Palestine

    Mohammed A. Awadallah

Authors
  1. Abdelaziz I. Hammouri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Malik Sh. Braik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohammed Azmi Al-Betar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mohammed A. Awadallah
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abdelaziz I. Hammouri.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hammouri, A.I., Braik, M.S., Al-Betar, M.A. et al. ISA: a hybridization between iterated local search and simulated annealing for multiple-runway aircraft landing problem. Neural Comput & Applic 32, 11745–11765 (2020). https://doi.org/10.1007/s00521-019-04659-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-019-04659-y

Keywords

Search

Navigation