{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T18:02:47Z","timestamp":1771956167867,"version":"3.50.1"},"reference-count":20,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2018,4,28]],"date-time":"2018-04-28T00:00:00Z","timestamp":1524873600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12,18]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The patient admission scheduling (PAS) problem is an optimization problem in which we assign patients automatically to beds for a specific period of time while preserving their medical requirements and their preferences. In this paper, we present a novel solution to the PAS problem using the harmony search (HS) algorithm. We tailor the HS to solve the PAS problem by distributing patients to beds randomly in the harmony memory (HM) while respecting all hard constraints. The proposed algorithm uses five neighborhood strategies in the pitch adjustment stage. This technique helps in increasing the variations of the generated solutions by exploring more solutions in the search space. The PAS standard benchmark datasets are used in the evaluation. Initially, a sensitivity analysis of the HS algorithm is studied to show the effect of its control parameters on the HS performance. The proposed method is also compared with nine methods: non-linear great deluge (NLGD), simulated annealing with hyper-heuristic (HH-SA), improved with equal hyper-heuristic (HH-IE), simulated annealing (SA), tabu search (TS), simple random simulated annealing with dynamic heuristic (DHS-SA), simple random improvement with dynamic heuristic (DHS-OI), simple random great deluge with dynamic heuristic (DHS-GD), and biogeography-based optimization (BBO). The proposed HS algorithm is able to produce comparably competitive results when compared with these methods. This proves that the proposed HS is a very efficient alternative to the PAS problem, which can be efficiently used to solve many scheduling problems of a large-scale data.<\/jats:p>","DOI":"10.1515\/jisys-2018-0094","type":"journal-article","created":{"date-parts":[[2018,4,30]],"date-time":"2018-04-30T23:10:17Z","timestamp":1525129817000},"page":"540-553","source":"Crossref","is-referenced-by-count":17,"title":["Harmony Search Algorithm for Patient Admission Scheduling Problem"],"prefix":"10.1515","volume":"29","author":[{"given":"Iyad","family":"Abu Doush","sequence":"first","affiliation":[{"name":"Computer Science and Information Systems Department , American University of Kuwait , Salmiya , Kuwait"},{"name":"Computer Science Department , Yarmouk University , Irbid , Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Azmi","family":"Al-Betar","sequence":"additional","affiliation":[{"name":"Department of Information Technology , Al-Huson University College, Al-Balqa Applied University , Al-Huson, Irbid , Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7815-8946","authenticated-orcid":false,"given":"Mohammed A.","family":"Awadallah","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Al-Aqsa University , P. O. Box 4051 , Gaza , Palestine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelaziz I.","family":"Hammouri","sequence":"additional","affiliation":[{"name":"Department of Computer Information System , Al-Balqa Applied University , Al-Salt , Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0439-9210","authenticated-orcid":false,"given":"Ra\u2019ed M.","family":"Al-Khatib","sequence":"additional","affiliation":[{"name":"Computer Science Department , Yarmouk University , Irbid , Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saba","family":"ElMustafa","sequence":"additional","affiliation":[{"name":"Computer Science Department , Yarmouk University , Irbid , Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Habes","family":"ALkhraisat","sequence":"additional","affiliation":[{"name":"Department of Computer Information System , Al-Balqa Applied University , Al-Salt , Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2018,4,28]]},"reference":[{"key":"2025120523362768472_j_jisys-2018-0094_ref_001","doi-asserted-by":"crossref","unstructured":"M. A. Al-Betar, A. T. Khader and I. A. Doush, Memetic techniques for examination timetabling, Ann. Oper. Res. 218 (2014), 23\u201350.","DOI":"10.1007\/s10479-013-1500-7"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_002","doi-asserted-by":"crossref","unstructured":"M. A. Al-Betar, M. A. Awadallah, A. T. Khader, A. L. Bolaji and A. Almomani, Economic load dispatch problems with valve-point loading using natural updated harmony search, Neural Comput. Appl. 29 (2016), 767\u2013781.","DOI":"10.1007\/s00521-016-2611-2"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_003","doi-asserted-by":"crossref","unstructured":"M. A. Awadallah, M. A. Al-Betar, A. T. Khader, A. L. Bolaji and M. Alkoffash, Hybridization of harmony search with hill climbing for highly constrained nurse rostering problem, Neural Comput. Appl. 28 (2017), 463\u2013482.","DOI":"10.1007\/s00521-015-2076-8"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_004","unstructured":"B. Bilgin, P. Demeester and G. V. Berghe, A hyperheuristic approach to the patient admission scheduling problem, Tech. rep., KaHo Sint-Lieven, Gent (2008)."},{"key":"2025120523362768472_j_jisys-2018-0094_ref_005","doi-asserted-by":"crossref","unstructured":"B. Bilgin, P. Demeester, M. Misir, W. Vancroonenburg and G. Vanden Berghe, One hyper-heuristic approach to two timetabling problems in health care, Journal of Heuristics 18 (2012), 401\u2013434.","DOI":"10.1007\/s10732-011-9192-0"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_006","doi-asserted-by":"crossref","unstructured":"S. Ceschia and A. Schaerf, Local search and lower bounds for the patient admission scheduling problem, Comput. Oper. Res. 38 (2011), 1452\u20131463.","DOI":"10.1016\/j.cor.2011.01.007"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_007","doi-asserted-by":"crossref","unstructured":"C.-F. Chien, F.-P. Tseng and C.-H. Chen, An evolutionary approach to rehabilitation patient scheduling: a case study, Eur. J. Oper. Res. 189 (2008), 1234\u20131253.","DOI":"10.1016\/j.ejor.2007.01.062"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_008","doi-asserted-by":"crossref","unstructured":"I. Doush, Harmony search with multi-parent crossover for solving IEEE-CEC2011 competition problems, in: Neural Information Processing, pp. 108\u2013114, Springer Berlin\/Heidelberg, 2012.","DOI":"10.1007\/978-3-642-34478-7_14"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_009","doi-asserted-by":"crossref","unstructured":"I. A. Doush and M. Q. Bataineh, Hybedrized NSGA-II AND MOEA\/D with harmony search algorithm to solve multi-objective optimization problems, in: International Conference on Neural Information Processing, pp. 606\u2013614, Springer International Publishing, Istanbul, Turkey, 2015.","DOI":"10.1007\/978-3-319-26532-2_67"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_010","doi-asserted-by":"crossref","unstructured":"I. A. Doush, F. Alkhateeb, E. Al Maghayreh, M. A. Al-Betar and B. H. F. Hasan, Hybridizing harmony search algorithm with multi-parent crossover to solve real world optimization problems, IJAMC 4 (2013), 1\u201314.","DOI":"10.4018\/ijamc.2013070101"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_011","doi-asserted-by":"crossref","unstructured":"I. A. Doush, M. A. Al-Betar, A. T. Khader, M. A. Awadallah and A. B. Mohammed, Analysis of takeover time and convergence rate for harmony search with novel selection methods, Int. J. Math. Model. Numer. Optim. 4 (2013), 305\u2013322.","DOI":"10.1504\/IJMMNO.2013.059192"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_012","unstructured":"M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, W. H. Freeman & Co., New York, NY, USA, 1990."},{"key":"2025120523362768472_j_jisys-2018-0094_ref_013","doi-asserted-by":"crossref","unstructured":"Z. Geem, J. Kim and G. Loganathan, A new heuristic optimization algorithm: harmony search, Simulation 76 (2001), 60\u201368.","DOI":"10.1177\/003754970107600201"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_014","unstructured":"A. I. Hammouri and B. Alrifai, Investigating biogeography-based optimisation for patient admission scheduling problems, J. Theor. Appl. Inf. Technol. 70 (2014), 413\u2013421."},{"key":"2025120523362768472_j_jisys-2018-0094_ref_015","doi-asserted-by":"crossref","unstructured":"S. Kifah and S. Abdullah, An adaptive non-linear great deluge algorithm for the patient-admission problem, Inf. Sci. 295 (2015), 573\u2013585.","DOI":"10.1016\/j.ins.2014.10.004"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_016","doi-asserted-by":"crossref","unstructured":"R. M. Lusby, M. Schwierz, T. M. Range and J. Larsen, An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem, Artif. Intell. Med. 74 (2016), 21\u201331.","DOI":"10.1016\/j.artmed.2016.10.002"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_017","unstructured":"R. Sawalha and I. Doush, Face recognition using harmony search-based selected features, IJHIT 5 (2012), 1\u201316."},{"key":"2025120523362768472_j_jisys-2018-0094_ref_018","unstructured":"W. Vancroonenburg, D. Goossens and F. Spieksma, On the complexity of the patient assignment problem, Tech. rep., Tech. rep., KAHO Sint-Lieven, Gebroeders De Smetstraat 1, Gent, Belgium, URL http:\/\/allserv.kahosl.be\/wimvc\/pas-complexity-techreport.pdf (2011)."},{"key":"2025120523362768472_j_jisys-2018-0094_ref_019","doi-asserted-by":"crossref","unstructured":"W. Vancroonenburg, P. De Causmaecker and G. Vanden Berghe, A study of decision support models for online patient-to-room assignment planning, Ann. Oper. Res. 239 (2016), 253\u2013271.","DOI":"10.1007\/s10479-013-1478-1"},{"key":"2025120523362768472_j_jisys-2018-0094_ref_020","doi-asserted-by":"crossref","unstructured":"L. M. Zhang, H. Y. Chang and R. T. Xu, The patient admission scheduling of an ophthalmic hospital using genetic algorithm, Adv. Mater. Res., Trans. Tech. Publ. 756 (2013), 1423\u20131432.","DOI":"10.4028\/www.scientific.net\/AMR.756-759.1423"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jisys\/29\/1\/article-p540.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2018-0094\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2018-0094\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:38:17Z","timestamp":1764977897000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2018-0094\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,28]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,4,25]]},"published-print":{"date-parts":[[2019,12,18]]}},"alternative-id":["10.1515\/jisys-2018-0094"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2018-0094","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"value":"2191-026X","type":"electronic"},{"value":"0334-1860","type":"print"}],"subject":[],"published":{"date-parts":[[2018,4,28]]}}}