{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T07:25:12Z","timestamp":1784273112113,"version":"3.55.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T00:00:00Z","timestamp":1576195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T00:00:00Z","timestamp":1576195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s00521-019-04659-y","type":"journal-article","created":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T09:04:46Z","timestamp":1576227886000},"page":"11745-11765","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["ISA: a hybridization between iterated local search and simulated annealing for multiple-runway aircraft landing problem"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0612-8246","authenticated-orcid":false,"given":"Abdelaziz I.","family":"Hammouri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Malik Sh.","family":"Braik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed Azmi","family":"Al-Betar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed A.","family":"Awadallah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,12,13]]},"reference":[{"issue":"2","key":"4659_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10288-011-0172-x","volume":"9","author":"JA Bennell","year":"2011","unstructured":"Bennell JA, Mesgarpour M, Potts CN (2011) Airport runway scheduling. 4OR 9(2):115","journal-title":"4OR"},{"issue":"3","key":"4659_CR2","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.ejor.2014.10.064","volume":"242","author":"A Faye","year":"2015","unstructured":"Faye A (2015) Solving the aircraft landing problem with time discretization approach. Eur J Oper Res 242(3):1028\u20131038","journal-title":"Eur J Oper Res"},{"key":"4659_CR3","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.asoc.2016.04.011","volume":"44","author":"BS Girish","year":"2016","unstructured":"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\u2013221","journal-title":"Appl Soft Comput"},{"issue":"1","key":"4659_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10951-013-0337-x","volume":"17","author":"D Briskorn","year":"2014","unstructured":"Briskorn D, Stolletz R (2014) Aircraft landing problems with aircraft classes. J Sched 17(1):31\u201345","journal-title":"J Sched"},{"issue":"2","key":"4659_CR5","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ejor.2004.09.040","volume":"171","author":"H Pinol","year":"2006","unstructured":"Pinol H, Beasley JE (2006) Scatter search and bionomic algorithms for the aircraft landing problem. Eur J Oper Res 171(2):439\u2013462","journal-title":"Eur J Oper Res"},{"issue":"1","key":"4659_CR6","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1057\/palgrave.jors.2601650","volume":"55","author":"JE Beasley","year":"2004","unstructured":"Beasley JE, Krishnamoorthy M, Sharaiha YM, Abramson D (2004) Displacement problem and dynamically scheduling aircraft landings. J Oper Res Soc 55(1):54\u201364","journal-title":"J Oper Res Soc"},{"issue":"1","key":"4659_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ejor.2014.11.027","volume":"243","author":"A Lieder","year":"2015","unstructured":"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\u201369","journal-title":"Eur J Oper Res"},{"issue":"Supplement C","key":"4659_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.tre.2016.01.015","volume":"88","author":"A Lieder","year":"2016","unstructured":"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\u2013188","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"1","key":"4659_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.cor.2012.06.004","volume":"40","author":"A Salehipour","year":"2013","unstructured":"Salehipour A, Modarres M, Naeni LM (2013) An efficient hybrid meta-heuristic for aircraft landing problem. Comput Oper Res 40(1):207\u2013213","journal-title":"Comput Oper Res"},{"issue":"5","key":"4659_CR10","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10951-014-0415-8","volume":"18","author":"F Furini","year":"2015","unstructured":"Furini F, Kidd MP, Persiani CA, Toth P (2015) Improved rolling horizon approaches to the aircraft sequencing problem. J Sched 18(5):435\u2013447","journal-title":"J Sched"},{"issue":"2","key":"4659_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/trsc.34.2.180.12302","volume":"34","author":"JE Beasley","year":"2000","unstructured":"Beasley JE, Krishnamoorthy M, Sharaiha YM, Abramson D (2000) Scheduling aircraft landings\u2014the static case. Transp Sci 34(2):180\u2013197","journal-title":"Transp Sci"},{"key":"4659_CR12","doi-asserted-by":"crossref","unstructured":"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\u201327","DOI":"10.1109\/CSE.2013.14"},{"key":"4659_CR13","doi-asserted-by":"crossref","unstructured":"D\u00c1pice C, De Nicola C, Manzo R, Moccia V (2014) Optimal scheduling for aircraft departures. J Ambient Intell Humani Comput 5(6):799\u2013807","DOI":"10.1007\/s12652-014-0223-1"},{"key":"4659_CR14","first-page":"141","volume-title":"Heuristics, metaheuristics and approximate methods in planning and scheduling","author":"F Farhadi","year":"2016","unstructured":"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\u2013163"},{"issue":"5","key":"4659_CR15","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BF02125421","volume":"63","author":"IH Osman","year":"1996","unstructured":"Osman IH, Laporte G (1996) Metaheuristics: a bibliography. Ann Oper Res 63(5):511\u2013623","journal-title":"Ann Oper Res"},{"issue":"3","key":"4659_CR16","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv: CSUR 35(3):268\u2013308","journal-title":"ACM Comput Surv: CSUR"},{"issue":"3","key":"4659_CR17","doi-asserted-by":"publisher","first-page":"35:1","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M \u010crepin\u0161ek","year":"2013","unstructured":"\u010crepin\u0161ek M, Liu S-H, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv 45(3):35:1\u201335:33","journal-title":"ACM Comput Surv"},{"issue":"5","key":"4659_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.jairtraman.2004.05.004","volume":"10","author":"S Capri","year":"2004","unstructured":"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\u2013351","journal-title":"J Air Transp Manag"},{"issue":"5","key":"4659_CR19","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.engappai.2004.11.012","volume":"18","author":"H Xiao-Bing","year":"2005","unstructured":"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\u2013642","journal-title":"Eng Appl Artif Intell"},{"key":"4659_CR20","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1057\/palgrave.jors.2601129","volume":"52","author":"JE Beasley","year":"2001","unstructured":"Beasley JE, Sonander J, Havelock P (2001) Scheduling aircraft landings at London Heathrow using a population heuristic. J Oper Res Soc 52:483\u2013493","journal-title":"J Oper Res Soc"},{"key":"4659_CR21","doi-asserted-by":"crossref","unstructured":"Farah I, Kansou A, Yassine A, Galinho T (2011) Ant colony optimization for aircraft landings. In: 2011 4th international conference on logistics, pp 235\u2013240","DOI":"10.1109\/LOGISTIQUA.2011.5939296"},{"key":"4659_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/236756","volume":"2014","author":"W Ma","year":"2014","unstructured":"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\u20138","journal-title":"Math Probl Eng"},{"key":"4659_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tre.2017.08.006","volume":"106","author":"KKH Ng","year":"2017","unstructured":"Ng KKH, Lee CKM, Chan FTS, Qin Y (2017) Robust aircraft sequencing and scheduling problem with arrival\/departure delay using the min\u2013max regret approach. Transp Res Part E Logist Transp Rev 106:115\u2013136","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"2","key":"4659_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s12046-015-0400-8","volume":"41","author":"K Dastgerdi","year":"2016","unstructured":"Dastgerdi K, Mehrshad N, Farshad M (2016) A new intelligent approach for air traffic control using gravitational search algorithm. Sadhana 41(2):183\u2013191","journal-title":"Sadhana"},{"issue":"1","key":"4659_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-013-1500-7","volume":"218","author":"MA Al-Betar","year":"2014","unstructured":"Al-Betar MA, Khader AT, Doush IA (2014) Memetic techniques for examination timetabling. Ann OR 218(1):23\u201350","journal-title":"Ann OR"},{"key":"4659_CR26","doi-asserted-by":"crossref","unstructured":"Van Laarhoven PJM, Aarts EHL (eds) (1987) Simulated annealing. In: Simulated annealing: theory and applications. Springer, Netherlands pp 7\u201315","DOI":"10.1007\/978-94-015-7744-1_2"},{"key":"4659_CR27","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.omega.2015.03.007","volume":"56","author":"NR Sabar","year":"2015","unstructured":"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\u201398","journal-title":"Omega"},{"issue":"1","key":"4659_CR28","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02601639","volume":"63","author":"OC Martin","year":"1996","unstructured":"Martin OC, Otto SW (1996) Combining simulated annealing with local search heuristics. Ann Oper Res 63(1):57\u201375","journal-title":"Ann Oper Res"},{"issue":"1","key":"4659_CR29","doi-asserted-by":"publisher","first-page":"7","DOI":"10.3923\/ijscomp.2010.7.12","volume":"5","author":"K Rajalakshmi","year":"2010","unstructured":"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\u201312","journal-title":"Int J Soft Comput"},{"issue":"1","key":"4659_CR30","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"4659_CR31","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.ejor.2005.01.066","volume":"174","author":"T St\u00fatzle","year":"2006","unstructured":"St\u00fatzle T (2006) Iterated local search for the quadratic assignment problem. Eur J Oper Res 174(3):1519\u20131539","journal-title":"Eur J Oper Res"},{"issue":"4598","key":"4659_CR32","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP et al (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"11","key":"4659_CR33","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) Or-library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"issue":"10","key":"4659_CR34","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda S, Fern\u00e1ndez 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\u20132064","journal-title":"Inf Sci"},{"issue":"1","key":"4659_CR35","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-010-0769-z","volume":"194","author":"MA Al-Betar","year":"2012","unstructured":"Al-Betar MA, Khader AT (2012) A harmony search algorithm for university course timetabling. Ann Oper Res 194(1):3\u201331","journal-title":"Ann Oper Res"},{"issue":"1","key":"4659_CR36","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-013-1500-7","volume":"218","author":"MA Al-Betar","year":"2014","unstructured":"Al-Betar MA, Khader AT, Doush IA (2014) Memetic techniques for examination timetabling. Ann Oper Res 218(1):23\u201350","journal-title":"Ann Oper Res"},{"key":"4659_CR37","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1016\/j.asoc.2015.07.004","volume":"35","author":"MA Awadallah","year":"2015","unstructured":"Awadallah MA, Bolaji AL, Al-Betar MA (2015) A hybrid artificial bee colony for a nurse rostering problem. Appl Soft Comput 35:726\u2013739","journal-title":"Appl Soft Comput"},{"issue":"4","key":"4659_CR38","first-page":"559","volume":"28","author":"E Alsukni","year":"2019","unstructured":"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\u2013570","journal-title":"J Intell Syst"},{"issue":"3","key":"4659_CR39","first-page":"413","volume":"70","author":"AI Hammouri","year":"2014","unstructured":"Hammouri AI, Alrifai B (2014) Investigating biogeography-based optimisation for patient admission scheduling problems. J Theor Appl Inf Technol 70(3):413\u2013421","journal-title":"J Theor Appl Inf Technol"},{"key":"4659_CR40","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-981-13-9263-4_9","volume-title":"Applied nature-inspired computing: algorithms and case studies","author":"A Sheta","year":"2020","unstructured":"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\u2013230"},{"key":"4659_CR41","doi-asserted-by":"crossref","unstructured":"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\u2013141","DOI":"10.1109\/ICCSCE.2018.8684963"},{"issue":"4","key":"4659_CR42","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search: a tutorial. Interfaces 20(4):74\u201394","journal-title":"Interfaces"},{"issue":"1","key":"4659_CR43","first-page":"61","volume":"19","author":"MGC Resende","year":"2003","unstructured":"Resende MGC, Velarde JLG (2003) Grasp: Greedy randomized adaptive search procedures. Intel Artif Rev Iberoam Intel Artif 19(1):61\u201376","journal-title":"Intel Artif Rev Iberoam Intel Artif"},{"issue":"1","key":"4659_CR44","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00521-016-2328-2","volume":"28","author":"MA Al-Betar","year":"2017","unstructured":"Al-Betar MA (2017) $$\\beta $$-hill climbing: an exploratory local search. Neural Comput Appl 28(1):153\u2013168","journal-title":"Neural Comput Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04659-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-019-04659-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04659-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T08:22:17Z","timestamp":1749802937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-019-04659-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,13]]},"references-count":44,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["4659"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04659-y","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,13]]},"assertion":[{"value":"24 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}