{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T14:44:21Z","timestamp":1784645061187,"version":"3.55.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"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":["Soft Comput"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s00500-025-10631-x","type":"journal-article","created":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T08:12:30Z","timestamp":1747123950000},"page":"3241-3251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adaptive iterated local search algorithm for dynamic patient admission scheduling problems"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8415-7328","authenticated-orcid":false,"given":"Ayad","family":"Turky","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nasser R.","family":"Sabar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andy","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abir","family":"Hussain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panos","family":"Liatsis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,13]]},"reference":[{"key":"10631_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-023-09470-5","author":"NA Alawad","year":"2023","unstructured":"Alawad NA, Abed-alguni BH, Saleh II (2023) Improved arithmetic optimization algorithm for patient admission scheduling problem. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-023-09470-5","journal-title":"Soft Comput"},{"issue":"3","key":"10631_CR2","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10732-011-9192-0","volume":"18","author":"B Bilgin","year":"2012","unstructured":"Bilgin B, Demeester P, Misir M, Vancroonenburg W, Berghe GV (2012) One hyper-heuristic approach to two timetabling problems in health care. J Heuristics 18(3):401\u2013434","journal-title":"J Heuristics"},{"key":"10631_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.knosys.2018.01.017","volume":"145","author":"AL Bolaji","year":"2018","unstructured":"Bolaji AL, Bamigbola AF, Shola PB (2018) Late acceptance hill climbing algorithm for solving patient admission scheduling problem. Knowl Based Syst 145:197\u2013206","journal-title":"Knowl Based Syst"},{"issue":"10","key":"10631_CR4","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1016\/j.cor.2011.01.007","volume":"38","author":"S Ceschia","year":"2011","unstructured":"Ceschia S, Schaerf A (2011) Local search and lower bounds for the patient admission scheduling problem. Comput Oper Res 38(10):1452\u20131463","journal-title":"Comput Oper Res"},{"issue":"3","key":"10631_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.artmed.2012.09.001","volume":"56","author":"S Ceschia","year":"2012","unstructured":"Ceschia S, Schaerf A (2012) Modeling and solving the dynamic patient admission scheduling problem under uncertainty. Artif Intell Med 56(3):199\u2013205","journal-title":"Artif Intell Med"},{"issue":"4","key":"10631_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10951-014-0407-8","volume":"19","author":"S Ceschia","year":"2016","unstructured":"Ceschia S, Schaerf A (2016) Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays. J Sched 19(4):377\u2013389","journal-title":"J Sched"},{"issue":"1","key":"10631_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.artmed.2009.09.001","volume":"48","author":"P Demeester","year":"2010","unstructured":"Demeester P, Souffriau W, De Causmaecker P, Berghe GV (2010) A hybrid tabu search algorithm for automatically assigning patients to beds. Artif Intell Med 48(1):61\u201370","journal-title":"Artif Intell Med"},{"issue":"2","key":"10631_CR8","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.ejor.2018.02.007","volume":"268","author":"R Guido","year":"2018","unstructured":"Guido R, Groccia MC, Conforti D (2018) An efficient matheuristic for offline patient-to-bed assignment problems. Eur J Oper Res 268(2):486\u2013503","journal-title":"Eur J Oper Res"},{"key":"10631_CR9","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Dubois-Lacoste J, C\u00e1ceres LP, Birattari M, St\u00fctzle T (2016) The irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43\u201358","journal-title":"Oper Res Perspect"},{"key":"10631_CR10","unstructured":"Louren\u00e7o HR, Martin O, St\u00fctzle T (2001) A beginners introduction to iterated local search. In: Proceedings of MIC, pp 1\u20136"},{"key":"10631_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_11","volume-title":"Iterated local search","author":"HR Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2003) Iterated local search. Springer, Berlin"},{"key":"10631_CR12","first-page":"363","volume-title":"Iterated local search: framework and applications. Handbook of metaheuristics","author":"HR Louren\u00e7o","year":"2010","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2010) Iterated local search: framework and applications. Handbook of metaheuristics. Springer, Berlin, pp 363\u2013397"},{"key":"10631_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.artmed.2016.10.002","volume":"74","author":"RM Lusby","year":"2016","unstructured":"Lusby RM, Schwierz M, Range TM, Larsen J (2016) An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem. Artif Intell Med 74:21\u201331","journal-title":"Artif Intell Med"},{"issue":"1","key":"10631_CR14","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.ejor.2013.10.050","volume":"235","author":"TM Range","year":"2014","unstructured":"Range TM, Lusby RM, Larsen J (2014) A column generation approach for solving the patient admission scheduling problem. Eur J Oper Res 235(1):252\u2013264","journal-title":"Eur J Oper Res"},{"key":"10631_CR15","doi-asserted-by":"crossref","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","DOI":"10.1016\/j.omega.2015.03.007"},{"key":"10631_CR16","doi-asserted-by":"crossref","unstructured":"Stanovov V, Akhmedova S, Semenkin E (2022) The automatic design of parameter adaptation techniques for differential evolution with genetic programming. Knowl Based Syst 239:108070","DOI":"10.1016\/j.knosys.2021.108070"},{"key":"10631_CR17","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.cor.2016.11.016","volume":"80","author":"AM Turhan","year":"2017","unstructured":"Turhan AM, Bilgen B (2017) Mixed integer programming based heuristics for the patient admission scheduling problem. Comput Oper Res 80:38\u201349","journal-title":"Comput Oper Res"},{"key":"10631_CR18","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.cor.2018.12.001","volume":"104","author":"Y-H Zhu","year":"2019","unstructured":"Zhu Y-H, Toffolo TA, Vancroonenburg W, Berghe GV (2019) Compatibility of short and long term objectives for dynamic patient admission scheduling. Comput Oper Res 104:98\u2013112","journal-title":"Comput Oper Res"},{"key":"10631_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107099","volume":"225","author":"L Zhu","year":"2021","unstructured":"Zhu L, Lin J, Li Y-Y, Wang Z-J (2021) A decomposition-based multi-objective genetic programming hyper-heuristic approach for the multi-skill resource constrained project scheduling problem. Knowl Based Syst 225:107099","journal-title":"Knowl Based Syst"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10631-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10631-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10631-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T07:07:44Z","timestamp":1749193664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10631-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["10631"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10631-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]},"assertion":[{"value":"8 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human participants and\/or animals"}},{"value":"We affirm that this study was conducted in compliance with the relevant ethical guidelines. This article does not contain any studies with human participants. We are committed to upholding ethical standards in our research and welcome inquiries regarding the ethical aspects of this study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}