Improved arithmetic optimization algorithm for patient admission scheduling problem

The patient admission scheduling problem (PASP) has been studied for many years as one of the most important scheduling problems in the health sector. The primary goal of PASP is to assign patients to appropriate hospital beds while considering some hard and soft constraints. PASP is an NP-hard prob...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Soft computing (Berlin, Germany) Jg. 28; H. 7-8; S. 5853 - 5879
Hauptverfasser:	Alawad, Noor Aldeen, Abed-alguni, Bilal H., Saleh, Israa I.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2024 Springer Nature B.V
Schlagworte:	Algorithms Arithmetic Artificial Intelligence Benchmarks Comparative analysis Computational Intelligence Control Decision making Engineering Genetic algorithms Integer programming Mathematical analysis Mathematical Logic and Foundations Mechatronics Medical research Operators (mathematics) Optimization Optimization algorithms Parameter modification Patients Performance evaluation Robotics Scheduling Strategic management Island-based Arithmetic optimization algorithm Discrete optimization problems PASP benchmark Patient admission scheduling problem
ISSN:	1432-7643, 1433-7479
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	The patient admission scheduling problem (PASP) has been studied for many years as one of the most important scheduling problems in the health sector. The primary goal of PASP is to assign patients to appropriate hospital beds while considering some hard and soft constraints. PASP is an NP-hard problem, which implies that the optimization approach is one of the best approaches that can be used to solve it. The arithmetic optimization algorithm (AOA) is a new optimization algorithm that can effectively solve both continuous and discrete optimization problems. However, it may suffer from poor exploration and premature convergence to sub-optimal solutions due to some problems with its exploration operators. In this paper, we propose a new method for the PASP using an improved AOA algorithm called the island-based AOA ( i AOA). The new algorithm is based on a structured population model called the island model. This model distributes the population of candidate solutions among islands that periodically exchange some of the candidate solutions among each other based on a migration protocol. In i AOA, some modifications were applied to AOA’s parameters to make it capable of handling discrete space. We evaluated i AOA using a public benchmark for the PASP and compared our results with those of other baseline algorithms (DFPA, SA, HS, GD-NLGD, HTS, TS, I-BBO, and MBBO). The simulation results revealed that i AOA achieved the minimum average execution time on 5 out of 6 instances of the public benchmark. It also showed that i AOA achieved the second minimum average violation of the objective function over 10 independent runs. Finally, the statistical examination of the experimental results using Friedman and Wilcoxon tests confirms the significance of the results of i AOA compared with the other baseline algorithms.
AbstractList	The patient admission scheduling problem (PASP) has been studied for many years as one of the most important scheduling problems in the health sector. The primary goal of PASP is to assign patients to appropriate hospital beds while considering some hard and soft constraints. PASP is an NP-hard problem, which implies that the optimization approach is one of the best approaches that can be used to solve it. The arithmetic optimization algorithm (AOA) is a new optimization algorithm that can effectively solve both continuous and discrete optimization problems. However, it may suffer from poor exploration and premature convergence to sub-optimal solutions due to some problems with its exploration operators. In this paper, we propose a new method for the PASP using an improved AOA algorithm called the island-based AOA (iAOA). The new algorithm is based on a structured population model called the island model. This model distributes the population of candidate solutions among islands that periodically exchange some of the candidate solutions among each other based on a migration protocol. In iAOA, some modifications were applied to AOA’s parameters to make it capable of handling discrete space. We evaluated iAOA using a public benchmark for the PASP and compared our results with those of other baseline algorithms (DFPA, SA, HS, GD-NLGD, HTS, TS, I-BBO, and MBBO). The simulation results revealed that iAOA achieved the minimum average execution time on 5 out of 6 instances of the public benchmark. It also showed that iAOA achieved the second minimum average violation of the objective function over 10 independent runs. Finally, the statistical examination of the experimental results using Friedman and Wilcoxon tests confirms the significance of the results of iAOA compared with the other baseline algorithms. The patient admission scheduling problem (PASP) has been studied for many years as one of the most important scheduling problems in the health sector. The primary goal of PASP is to assign patients to appropriate hospital beds while considering some hard and soft constraints. PASP is an NP-hard problem, which implies that the optimization approach is one of the best approaches that can be used to solve it. The arithmetic optimization algorithm (AOA) is a new optimization algorithm that can effectively solve both continuous and discrete optimization problems. However, it may suffer from poor exploration and premature convergence to sub-optimal solutions due to some problems with its exploration operators. In this paper, we propose a new method for the PASP using an improved AOA algorithm called the island-based AOA ( i AOA). The new algorithm is based on a structured population model called the island model. This model distributes the population of candidate solutions among islands that periodically exchange some of the candidate solutions among each other based on a migration protocol. In i AOA, some modifications were applied to AOA’s parameters to make it capable of handling discrete space. We evaluated i AOA using a public benchmark for the PASP and compared our results with those of other baseline algorithms (DFPA, SA, HS, GD-NLGD, HTS, TS, I-BBO, and MBBO). The simulation results revealed that i AOA achieved the minimum average execution time on 5 out of 6 instances of the public benchmark. It also showed that i AOA achieved the second minimum average violation of the objective function over 10 independent runs. Finally, the statistical examination of the experimental results using Friedman and Wilcoxon tests confirms the significance of the results of i AOA compared with the other baseline algorithms.
Author	Alawad, Noor Aldeen Saleh, Israa I. Abed-alguni, Bilal H.
Author_xml	– sequence: 1 givenname: Noor Aldeen orcidid: 0000-0001-9442-440X surname: Alawad fullname: Alawad, Noor Aldeen email: nooraldeen@yu.edu.jo organization: Department of Computer Sciences, Yarmouk University – sequence: 2 givenname: Bilal H. surname: Abed-alguni fullname: Abed-alguni, Bilal H. organization: Department of Computer Sciences, Yarmouk University – sequence: 3 givenname: Israa I. surname: Saleh fullname: Saleh, Israa I. organization: Department of Computer Sciences, Yarmouk University
BookMark	eNp9kE1LxDAQhoOs4O7qH_BU8FydJE3bHGXxY2HBg3oOaZPuZmmbmmQF_fVmW0HwsKcZZt5nPt4FmvW21whdY7jFAMWdB2AAKRCaAs8KSNkZmuOM0rTICj4bc5IWeUYv0ML7PQDBBaNz9LruBmc_tUqkM2HX6WDqxA7BdOZbBmP7RLZbO7aSxrpkiEXdh0Sqznh_7Pt6p9WhNf02iZOqVneX6LyRrddXv3GJ3h8f3lbP6eblab2636Q1xTykUuMS5xWuG8o0yUsoJC4lUzzWGspJxQnnigPJcAVlqRvFKFVVzUBmDc0UXaKbaW7c-3HQPoi9Pbg-rhQUCkJZXjIcVeWkqp313ulG1CaMrwUnTSswiKOFYrJQRAvFaKFgESX_0MGZTrqv0xCdIB_F_Va7v6tOUD8wxoa9
CitedBy_id	crossref_primary_10_1016_j_knosys_2025_113156 crossref_primary_10_1016_j_bspc_2025_108541 crossref_primary_10_3390_technologies13040145 crossref_primary_10_1007_s10586_025_05540_5 crossref_primary_10_1007_s10586_024_04674_2 crossref_primary_10_1371_journal_pone_0318903 crossref_primary_10_1007_s10586_024_04866_w crossref_primary_10_1038_s41598_025_13539_6 crossref_primary_10_1007_s00500_025_10631_x crossref_primary_10_1371_journal_pone_0322111 crossref_primary_10_1093_jcde_qwaf024 crossref_primary_10_1007_s10696_025_09591_z
Cites_doi	10.1186/1472-6963-6-6 10.21203/rs.3.rs-822763/v1 10.1111/j.1937-5956.2011.01221.x 10.1109/TASE.2019.2942990 10.1007/s10729-006-9005-4 10.1080/02331934.2020.1829619 10.1016/j.jbi.2014.08.007 10.1016/j.artmed.2016.10.002 10.1007/s11227-023-05444-4 10.1214/ss/1177011077 10.1016/j.advengsoft.2013.03.004 10.1007/s11227-021-04050-6 10.1016/j.cor.2018.12.001 10.3390/e23091189 10.1016/j.eswa.2014.10.008 10.1007/978-3-319-50920-4_19 10.36306/konjes.904335 10.1007/s00521-023-08772-x 10.1007/s10489-022-04201-z 10.1016/j.cor.2016.11.016 10.1016/j.cma.2020.113609 10.1016/j.orhc.2018.01.004 10.1016/j.egyr.2021.04.042 10.1007/s11227-021-03998-9 10.1109/ACCESS.2021.3085529 10.3390/math10122152 10.1016/j.asoc.2011.05.008 10.1016/j.compbiomed.2021.105007 10.1016/j.ejor.2018.09.003 10.1016/j.knosys.2018.05.009 10.1080/00131857.2020.1728732 10.1080/10705519909540131 10.1007/s10586-021-03490-2 10.1016/j.jksuci.2020.01.013 10.1007/s00500-021-06665-6 10.1213/ANE.0b013e31827f53d7 10.1016/j.future.2023.05.021 10.1007/s00158-010-0496-8 10.1007/s42835-021-00758-w 10.1007/s12553-021-00547-5 10.1016/j.eswa.2019.112881 10.3390/pr9071155 10.1016/j.knosys.2018.01.017 10.1371/journal.pone.0255703 10.1016/j.artmed.2012.09.001 10.1016/j.ins.2014.02.123 10.14257/ijhit.2014.7.6.07 10.1007/s10462-019-09733-4 10.1088/1757-899X/166/1/012024 10.1007/s13369-021-06026-3 10.1016/j.asoc.2020.106170 10.1007/s10696-015-9219-1 10.1007/s13369-020-05141-x 10.1016/0167-9236(95)00011-9 10.1016/j.ejor.2018.03.001 10.1504/ijris.2019.10025171 10.1016/j.eswa.2018.01.019 10.1145/326619.326817 10.1515/jisys-2018-0094 10.1080/15326349.2020.1742161
ContentType	Journal Article
Copyright	The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
Copyright_xml	– notice: The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
DBID	AAYXX CITATION 8FE 8FG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS
DOI	10.1007/s00500-023-09470-5
DatabaseName	CrossRef ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central UK/Ireland ProQuest SciTech Premium Collection Technology Collection Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central ProQuest Technology Collection ProQuest One Community College ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China
DatabaseTitle	CrossRef Advanced Technologies & Aerospace Collection Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection ProQuest One Academic Eastern Edition SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central Advanced Technologies & Aerospace Database ProQuest One Applied & Life Sciences ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New)
DatabaseTitleList	Advanced Technologies & Aerospace Collection
Database_xml	– sequence: 1 dbid: P5Z name: Advanced Technologies & Aerospace Database url: https://search.proquest.com/hightechjournals sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1433-7479
EndPage	5879
ExternalDocumentID	10_1007_s00500_023_09470_5
GroupedDBID	-5B -5G -BR -EM -Y2 -~C .86 .VR 06D 0R~ 0VY 1N0 1SB 203 29~ 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K7- KDC KOV LAS LLZTM M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM P2P P9P PF0 PT4 PT5 QOS R89 R9I RIG RNI ROL RPX RSV RZK S16 S1Z S27 S3B SAP SDH SEG SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7X Z7Y Z7Z Z81 Z83 Z88 ZMTXR AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 8FE 8FG AZQEC DWQXO GNUQQ JQ2 P62 PKEHL PQEST PQQKQ PQUKI PRINS
ID	FETCH-LOGICAL-c319t-ae1816b1cf35e26807a18a5d96b1f392b9299d90241b088efd533dbc50a4f34d3
IEDL.DBID	RSV
ISICitedReferencesCount	13
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001130364400006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1432-7643
IngestDate	Wed Nov 05 02:10:32 EST 2025 Tue Nov 18 21:15:49 EST 2025 Sat Nov 29 03:36:34 EST 2025 Fri Feb 21 02:40:36 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	7-8
Keywords	Island-based Arithmetic optimization algorithm Discrete optimization problems PASP benchmark Patient admission scheduling problem
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c319t-ae1816b1cf35e26807a18a5d96b1f392b9299d90241b088efd533dbc50a4f34d3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-9442-440X
PQID	3072356851
PQPubID	2043697
PageCount	27
ParticipantIDs	proquest_journals_3072356851 crossref_citationtrail_10_1007_s00500_023_09470_5 crossref_primary_10_1007_s00500_023_09470_5 springer_journals_10_1007_s00500_023_09470_5
PublicationCentury	2000
PublicationDate	20240400
PublicationDateYYYYMMDD	2024-04-01
PublicationDate_xml	– month: 4 year: 2024 text: 20240400
PublicationDecade	2020
PublicationPlace	Berlin/Heidelberg
PublicationPlace_xml	– name: Berlin/Heidelberg – name: Heidelberg
PublicationSubtitle	A Fusion of Foundations, Methodologies and Applications
PublicationTitle	Soft computing (Berlin, Germany)
PublicationTitleAbbrev	Soft Comput
PublicationYear	2024
Publisher	Springer Berlin Heidelberg Springer Nature B.V
Publisher_xml	– name: Springer Berlin Heidelberg – name: Springer Nature B.V
References	Ibrahim (CR46) 2021 Wang, Guo, Gandomi, Hao, Wang (CR60) 2014; 274 Demeester, Souffriau, De Causmaecker, Vanden-Berghe (CR35) 2010; 48 Gharehchopogh, Shayanfar, Gholizadeh (CR41) 2020; 53 Zhang, Chang, Xu (CR63) 2014; 756 Issa, Hassanien, Oliva, Helmi, Ziedan, Alzohairy (CR47) 2018; 99 Al-Betar, Awadallah, Khader, Abdalkareem (CR17) 2015; 42 Hulshof, Mes, Boucherie, Hans (CR45) 2016; 28 CR31 Kaveh, Farhoudi (CR48) 2013; 59 Baş (CR23) 2021 Barhoush, Abed-alguni, Al-qudah (CR22) 2023; 79 Srivastava, Srivastava, Chaudhary, Guzmán-Guzmán, García-Díaz (CR57) 2021 Abed-Alguni (CR3) 2019; 17 Abed-alguni, Alawad, Al-Betar, Paul (CR7) 2023; 53 May, Spangler, Strum, Vargas (CR52) 2011; 20 Turgut, Turgut, Eliiyi (CR58) 2020 Abdalkareem, Al-Betar, Amir, Ehkan, Hammouri, Salman (CR2) 2022; 141 Ceschia, Schaerf (CR27) 2012; 56 Premkumar (CR53) 2021; 9 Cope, Kalantzis, Searsmith (CR30) 2021; 53 Divine, Norton, Hunt, Dienemann (CR37) 2013; 117 Zhu, Luo, Shen, Xu, Kou (CR66) 2020 Turhan, Bilgen (CR59) 2017; 80 Earnest, Chen, Seow (CR38) 2006 Abed-Alguni, Klaib, Nahar (CR4) 2019; 11 D’Angelo, Farsimadan, Ficco, Palmieri, Robustelli (CR33) 2023; 148 Marynissen, Demeulemeester (CR51) 2019; 272 Bastos, Marchesi, Hamacher, Fleck (CR24) 2019; 273 CR8 Chakraborty, Kar (CR28) 2017 Alawad, Abed-alguni (CR14) 2022; 78 CR9 Hammouri (CR44) 2022; 34 Kaveh, Hamedani, Hamedani, Kamalinejad (CR49) 2021 Alawad, Abed-alguni (CR13) 2021; 46 Decerle, Grunder, Hajjam El Hassani, Barakat (CR34) 2018; 16 Zhu, Toffolo, Vancroonenburg, Vanden-Berghe (CR65) 2019; 104 Alawad, Abed-alguni, Al-Betar, Jaradat (CR15) 2023; 35 Ates, Abualigah, Abd-Elaziz (CR21) 2022 Chen, Zhou, Luo (CR29) 2022 Zhou, Geng, Jiang, Wang (CR64) 2020; 17 Granja, Almada-Lobo, Janela, Seabra, Mendes (CR42) 2014; 52 Abdalkareem, Amir, Al-Betar, Ekhan, Hammouri (CR1) 2021; 11 Faris (CR39) 2018; 154 Rigdon (CR56) 1999; 6 Lusby, Schwierz, Range, Larsen (CR50) 2016; 74 D’Angelo, Palmieri, Robustelli (CR32) 2022; 25 Agushaka, Ezugwu (CR12) 2021 Bertsimas, Tsitsiklis (CR25) 1993; 8 Alkhateeb, Abed-alguni, Al-rousan (CR19) 2022; 78 Al-Betar (CR16) 2021; 16 Abed-alguni, Paul (CR6) 2022; 26 Bolaji, Bamigbola, Shola (CR26) 2018; 145 Rajabioun (CR54) 2011; 11 Abed-alguni, Alawad (CR5) 2021; 102 Xu, Tan, Zhu, Ouyang, Taheri (CR62) 2021; 7 Hakim, Bakhtiar, Jaharuddin (CR43) 2017 Rezaeiahari, Khasawneh (CR55) 2020 Abualigah, Diabat, Sumari, Gandomi (CR11) 2021 Abualigah, Diabat, Mirjalili, Abd-Elaziz, Gandomi (CR10) 2021 CR20 Denton, Viapiano, Vogl (CR36) 2007; 10 Forgionne, Forgionne, Kohli (CR40) 1996; 16 Al-Daoud, Alshorman, Hanandeh (CR18) 2014; 7 Xiang, Arora, Abdel-Malek (CR61) 2010; 42 BH Abed-Alguni (9470_CR4) 2019; 11 E Al-Daoud (9470_CR18) 2014; 7 E Baş (9470_CR23) 2021 BH Abed-alguni (9470_CR7) 2023; 53 MA Al-Betar (9470_CR17) 2015; 42 AI Hammouri (9470_CR44) 2022; 34 R Rajabioun (9470_CR54) 2011; 11 AM Turhan (9470_CR59) 2017; 80 9470_CR31 9470_CR8 D Bertsimas (9470_CR25) 1993; 8 9470_CR9 B Cope (9470_CR30) 2021; 53 G Divine (9470_CR37) 2013; 117 A Kaveh (9470_CR48) 2013; 59 A Earnest (9470_CR38) 2006 V Srivastava (9470_CR57) 2021 M Rezaeiahari (9470_CR55) 2020 L Abualigah (9470_CR10) 2021 J Decerle (9470_CR34) 2018; 16 NA Alawad (9470_CR14) 2022; 78 9470_CR20 BH Abed-alguni (9470_CR5) 2021; 102 MA Al-Betar (9470_CR16) 2021; 16 FS Gharehchopogh (9470_CR41) 2020; 53 M Premkumar (9470_CR53) 2021; 9 YH Zhu (9470_CR65) 2019; 104 M Barhoush (9470_CR22) 2023; 79 M Issa (9470_CR47) 2018; 99 BH Abed-Alguni (9470_CR3) 2019; 17 C Granja (9470_CR42) 2014; 52 RA Ibrahim (9470_CR46) 2021 BH Abed-alguni (9470_CR6) 2022; 26 L Hakim (9470_CR43) 2017 MS Turgut (9470_CR58) 2020 F Alkhateeb (9470_CR19) 2022; 78 NA Alawad (9470_CR13) 2021; 46 Y Xiang (9470_CR61) 2010; 42 ZA Abdalkareem (9470_CR2) 2022; 141 L Abualigah (9470_CR11) 2021 B Denton (9470_CR36) 2007; 10 JH May (9470_CR52) 2011; 20 GG Wang (9470_CR60) 2014; 274 RM Lusby (9470_CR50) 2016; 74 P Demeester (9470_CR35) 2010; 48 G D’Angelo (9470_CR32) 2022; 25 G D’Angelo (9470_CR33) 2023; 148 NA Alawad (9470_CR15) 2023; 35 S Ceschia (9470_CR27) 2012; 56 H Faris (9470_CR39) 2018; 154 G Forgionne (9470_CR40) 1996; 16 LSL Bastos (9470_CR24) 2019; 273 PJH Hulshof (9470_CR45) 2016; 28 A Ates (9470_CR21) 2022 A Kaveh (9470_CR49) 2021 L Zhang (9470_CR63) 2014; 756 JO Agushaka (9470_CR12) 2021 YP Xu (9470_CR62) 2021; 7 EE Rigdon (9470_CR56) 1999; 6 M Chen (9470_CR29) 2022 A Chakraborty (9470_CR28) 2017 L Zhou (9470_CR64) 2020; 17 T Zhu (9470_CR66) 2020 J Marynissen (9470_CR51) 2019; 272 ZA Abdalkareem (9470_CR1) 2021; 11 AL Bolaji (9470_CR26) 2018; 145
References_xml	– year: 2006 ident: CR38 article-title: Exploring if day and time of admission is associated with average length of stay among inpatients from a tertiary hospital in Singapore: an analytic study based on routine admission data publication-title: BMC Health Serv Res doi: 10.1186/1472-6963-6-6 – year: 2022 ident: CR21 article-title: Distribution function based-arithmetic optimization algorithm for global optimization and engineering applications publication-title: Res Sq doi: 10.21203/rs.3.rs-822763/v1 – volume: 20 start-page: 392 issue: 3 year: 2011 end-page: 405 ident: CR52 article-title: The surgical scheduling problem: current research and future opportunities publication-title: Prod Oper Manag doi: 10.1111/j.1937-5956.2011.01221.x – volume: 17 start-page: 1124 issue: 3 year: 2020 end-page: 1139 ident: CR64 article-title: Public hospital inpatient room allocation and patient scheduling considering equity publication-title: IEEE Trans Autom Sci Eng doi: 10.1109/TASE.2019.2942990 – year: 2021 ident: CR49 publication-title: Improved arithmetic optimization algorithm for structural optimization with frequency constraints – volume: 10 start-page: 13 issue: 1 year: 2007 end-page: 24 ident: CR36 article-title: Optimization of surgery sequencing and scheduling decisions under uncertainty publication-title: Health Care Manag Sci doi: 10.1007/s10729-006-9005-4 – year: 2020 ident: CR66 article-title: Admission scheduling of inpatients by considering two inter-related resources: beds and operating rooms publication-title: Optimization doi: 10.1080/02331934.2020.1829619 – volume: 52 start-page: 427 year: 2014 end-page: 437 ident: CR42 article-title: An optimization based on simulation approach to the patient admission scheduling problem using a linear programing algorithm publication-title: J Biomed Inform doi: 10.1016/j.jbi.2014.08.007 – volume: 74 start-page: 21 year: 2016 end-page: 31 ident: CR50 article-title: An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem publication-title: Artif Intell Med doi: 10.1016/j.artmed.2016.10.002 – volume: 79 start-page: 21265 year: 2023 end-page: 21309 ident: CR22 article-title: Improved discrete salp swarm algorithm using exploration and exploitation techniques for feature selection in intrusion detection systems publication-title: J Supercomput doi: 10.1007/s11227-023-05444-4 – volume: 8 start-page: 10 issue: 1 year: 1993 end-page: 15 ident: CR25 article-title: Simulated annealing publication-title: Stat Sci doi: 10.1214/ss/1177011077 – volume: 59 start-page: 53 year: 2013 end-page: 70 ident: CR48 article-title: A new optimization method: Dolphin echolocation publication-title: Adv Eng Softw doi: 10.1016/j.advengsoft.2013.03.004 – ident: CR8 – volume: 78 start-page: 4799 issue: 4 year: 2022 end-page: 4826 ident: CR19 article-title: Discrete hybrid cuckoo search and simulated annealing algorithm for solving the job shop scheduling problem publication-title: J Supercomput doi: 10.1007/s11227-021-04050-6 – volume: 104 start-page: 98 year: 2019 end-page: 112 ident: CR65 article-title: Compatibility of short and long term objectives for dynamic patient admission scheduling publication-title: Comput Oper Res doi: 10.1016/j.cor.2018.12.001 – year: 2021 ident: CR46 article-title: An electric fish-based arithmetic optimization algorithm for feature selection publication-title: Entropy doi: 10.3390/e23091189 – volume: 42 start-page: 2026 issue: 4 year: 2015 end-page: 2035 ident: CR17 article-title: Island-based harmony search for optimization problems publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2014.10.008 – start-page: 475 year: 2017 end-page: 494 ident: CR28 article-title: Swarm intelligence: a review of algorithms publication-title: Modeling and optimization in science and technologies doi: 10.1007/978-3-319-50920-4_19 – year: 2021 ident: CR23 article-title: Hybrid the arithmetic optimization algorithm for constrained optimization problems publication-title: Konya J Eng Sci doi: 10.36306/konjes.904335 – volume: 17 start-page: 57 issue: 1 year: 2019 end-page: 82 ident: CR3 article-title: Island-based cuckoo search with highly disruptive polynomial mutation publication-title: Int J Artif Intell – volume: 35 start-page: 19427 year: 2023 end-page: 19451 ident: CR15 article-title: Binary improved white shark algorithm for intrusion detection systems publication-title: Neural Comput Appl doi: 10.1007/s00521-023-08772-x – volume: 53 start-page: 13224 issue: 11 year: 2023 end-page: 13260 ident: CR7 article-title: Opposition-based sine cosine optimizer utilizing refraction learning and variable neighborhood search for feature selection publication-title: Appl Intell doi: 10.1007/s10489-022-04201-z – ident: CR9 – volume: 80 start-page: 38 year: 2017 end-page: 49 ident: CR59 article-title: Mixed integer programming based heuristics for the patient admission scheduling problem publication-title: Comput Oper Res doi: 10.1016/j.cor.2016.11.016 – year: 2021 ident: CR10 article-title: The arithmetic optimization algorithm publication-title: Comput Methods Appl Mech Eng doi: 10.1016/j.cma.2020.113609 – volume: 16 start-page: 59 year: 2018 end-page: 71 ident: CR34 article-title: A memetic algorithm for a home health care routing and scheduling problem publication-title: Oper Res Health Care doi: 10.1016/j.orhc.2018.01.004 – volume: 7 start-page: 2332 year: 2021 end-page: 2342 ident: CR62 article-title: Model identification of the proton exchange membrane fuel cells by extreme learning machine and a developed version of arithmetic optimization algorithm publication-title: Energy Rep doi: 10.1016/j.egyr.2021.04.042 – volume: 78 start-page: 3517 issue: 3 year: 2022 end-page: 3538 ident: CR14 article-title: Discrete Jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem publication-title: J Supercomput doi: 10.1007/s11227-021-03998-9 – volume: 9 start-page: 84263 year: 2021 end-page: 84295 ident: CR53 article-title: A new arithmetic optimization algorithm for solving real-world multiobjective CEC-2021 constrained optimization problems: diversity analysis and validations publication-title: IEEE Access doi: 10.1109/ACCESS.2021.3085529 – year: 2022 ident: CR29 article-title: An improved arithmetic optimization algorithm for numerical optimization problems publication-title: Mathematics doi: 10.3390/math10122152 – volume: 11 start-page: 5508 issue: 8 year: 2011 end-page: 5518 ident: CR54 article-title: Cuckoo optimization algorithm publication-title: Appl Soft Comput J doi: 10.1016/j.asoc.2011.05.008 – volume: 141 start-page: 105007 year: 2022 ident: CR2 article-title: Discrete flower pollination algorithm for patient admission problem publication-title: Comput Biol Med doi: 10.1016/j.compbiomed.2021.105007 – volume: 273 start-page: 831 issue: 3 year: 2019 end-page: 840 ident: CR24 article-title: A mixed integer programming approach to the patient admission scheduling problem publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2018.09.003 – volume: 154 start-page: 43 year: 2018 end-page: 67 ident: CR39 article-title: An efficient binary Salp Swarm Algorithm with crossover scheme for feature selection problems publication-title: Knowl Based Syst doi: 10.1016/j.knosys.2018.05.009 – volume: 53 start-page: 1229 issue: 12 year: 2021 end-page: 1245 ident: CR30 article-title: Artificial intelligence for education: knowledge and its assessment in AI-enabled learning ecologies publication-title: Educ Philos Theory doi: 10.1080/00131857.2020.1728732 – volume: 6 start-page: 219 issue: 3 year: 1999 end-page: 232 ident: CR56 article-title: Using the Friedman method of ranks for model comparison in structural equation modeling publication-title: Struct Equ Model doi: 10.1080/10705519909540131 – volume: 25 start-page: 2487 issue: 4 year: 2022 end-page: 2500 ident: CR32 article-title: A federated approach to Android malware classification through Perm-Maps publication-title: Cluster Comput doi: 10.1007/s10586-021-03490-2 – volume: 34 start-page: 871 issue: 3 year: 2022 end-page: 879 ident: CR44 article-title: A modified biogeography-based optimization algorithm with guided bed selection mechanism for patient admission scheduling problems publication-title: J King Saud Univ Comput Inform Sci doi: 10.1016/j.jksuci.2020.01.013 – volume: 26 start-page: 3293 issue: 7 year: 2022 end-page: 3312 ident: CR6 article-title: Island-based Cuckoo Search with elite opposition-based learning and multiple mutation methods for solving optimization problems publication-title: Soft Comput doi: 10.1007/s00500-021-06665-6 – volume: 117 start-page: 699 issue: 3 year: 2013 end-page: 710 ident: CR37 article-title: A review of analysis and sample size calculation considerations for Wilcoxon tests publication-title: Anesth Analg doi: 10.1213/ANE.0b013e31827f53d7 – volume: 48 start-page: 61 year: 2010 end-page: 70 ident: CR35 article-title: A hybrid tabu search algorithm for automatically assigning patients to beds publication-title: Artif Intell – volume: 148 start-page: 93 year: 2023 end-page: 105 ident: CR33 article-title: Privacy-preserving malware detection in Android-based IoT devices through federated Markov chains publication-title: Futur Gener Comput Syst doi: 10.1016/j.future.2023.05.021 – volume: 42 start-page: 1 issue: 1 year: 2010 end-page: 23 ident: CR61 article-title: Physics-based modeling and simulation of human walking: a review of optimization-based and other approaches publication-title: Struct Multidiscip Optim doi: 10.1007/s00158-010-0496-8 – volume: 102 start-page: 1568 issue: 107113 year: 2021 end-page: 4946 ident: CR5 article-title: Distributed grey wolf optimizer for scheduling of workflow applications in cloud environments, applied soft computing publication-title: Appl Soft Comput – volume: 16 start-page: 1985 issue: 4 year: 2021 end-page: 2015 ident: CR16 article-title: Island-based harmony search algorithm for non-convex economic load dispatch problems publication-title: J Electr Eng Technol doi: 10.1007/s42835-021-00758-w – volume: 11 start-page: 445 issue: 3 year: 2021 end-page: 469 ident: CR1 article-title: Healthcare scheduling in optimization context: a review publication-title: Health Technol doi: 10.1007/s12553-021-00547-5 – year: 2020 ident: CR55 article-title: Simulation optimization approach for patient scheduling at destination medical centers publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2019.112881 – ident: CR31 – year: 2021 ident: CR11 article-title: A novel evolutionary arithmetic optimization algorithm for multilevel thresholding segmentation of COVID-19 CT images publication-title: Processes doi: 10.3390/pr9071155 – volume: 145 start-page: 197 year: 2018 end-page: 206 ident: CR26 article-title: Late acceptance hill climbing algorithm for solving patient admission scheduling problem publication-title: Knowl Based Syst doi: 10.1016/j.knosys.2018.01.017 – year: 2021 ident: CR12 article-title: Advanced arithmetic optimization algorithm for solving mechanical engineering design problems publication-title: PLoS ONE doi: 10.1371/journal.pone.0255703 – volume: 56 start-page: 199 issue: 3 year: 2012 end-page: 205 ident: CR27 article-title: Modeling and solving the dynamic patient admission scheduling problem under uncertainty publication-title: Artif Intell Med doi: 10.1016/j.artmed.2012.09.001 – volume: 274 start-page: 17 year: 2014 end-page: 34 ident: CR60 article-title: Chaotic Krill Herd algorithm publication-title: Inf Sci (n y) doi: 10.1016/j.ins.2014.02.123 – volume: 7 start-page: 83 issue: 6 year: 2014 end-page: 100 ident: CR18 article-title: A new efficient meta-heuristic optimization algorithm inspired by wild dog packs publication-title: Int J Hybrid Inform Technol doi: 10.14257/ijhit.2014.7.6.07 – volume: 53 start-page: 2265 issue: 3 year: 2020 end-page: 2312 ident: CR41 article-title: A comprehensive survey on symbiotic organisms search algorithms publication-title: Artif Intell Rev doi: 10.1007/s10462-019-09733-4 – year: 2017 ident: CR43 article-title: The nurse scheduling problem: a goal programming and nonlinear optimization approaches publication-title: IOP Conf Ser: Mater Sci Eng doi: 10.1088/1757-899X/166/1/012024 – year: 2021 ident: CR57 article-title: On comparing the performance of swarm-based algorithms with human-based algorithm for nonlinear systems publication-title: Arab J Sci Eng doi: 10.1007/s13369-021-06026-3 – year: 2020 ident: CR58 article-title: Island-based Crow search algorithm for solving optimal control problems publication-title: Appl Soft Comput J doi: 10.1016/j.asoc.2020.106170 – volume: 28 start-page: 30 issue: 1–2 year: 2016 end-page: 61 ident: CR45 article-title: Patient admission planning using approximate dynamic programming publication-title: Flex Serv Manuf J doi: 10.1007/s10696-015-9219-1 – volume: 46 start-page: 3213 issue: 4 year: 2021 end-page: 3233 ident: CR13 article-title: Discrete island-based cuckoo search with highly disruptive polynomial mutation and opposition-based learning strategy for scheduling of workflow applications in cloud environments publication-title: Arab J Sci Eng doi: 10.1007/s13369-020-05141-x – volume: 756 start-page: 1423 year: 2014 end-page: 1432 ident: CR63 article-title: The patient admission scheduling of an ophthalmic hospital using genetic algorithm publication-title: Adv Mater Res – volume: 16 start-page: 209 year: 1996 end-page: 229 ident: CR40 article-title: HMSS: a management support system for concurrent hospital decision making publication-title: Decis Support Syst doi: 10.1016/0167-9236(95)00011-9 – volume: 272 start-page: 407 issue: 2 year: 2019 end-page: 419 ident: CR51 article-title: Literature review on multi-appointment scheduling problems in hospitals publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2018.03.001 – volume: 11 start-page: 319 issue: 4 year: 2019 ident: CR4 article-title: Island-based whale optimisation algorithm for continuous optimisation problems publication-title: Int J Reason-Based Intell Syst doi: 10.1504/ijris.2019.10025171 – ident: CR20 – volume: 99 start-page: 56 year: 2018 end-page: 70 ident: CR47 article-title: ASCA-PSO: adaptive sine cosine optimization algorithm integrated with particle swarm for pairwise local sequence alignment publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2018.01.019 – volume: 28 start-page: 30 issue: 1–2 year: 2016 ident: 9470_CR45 publication-title: Flex Serv Manuf J doi: 10.1007/s10696-015-9219-1 – year: 2021 ident: 9470_CR11 publication-title: Processes doi: 10.3390/pr9071155 – volume: 148 start-page: 93 year: 2023 ident: 9470_CR33 publication-title: Futur Gener Comput Syst doi: 10.1016/j.future.2023.05.021 – volume-title: Improved arithmetic optimization algorithm for structural optimization with frequency constraints year: 2021 ident: 9470_CR49 – volume: 74 start-page: 21 year: 2016 ident: 9470_CR50 publication-title: Artif Intell Med doi: 10.1016/j.artmed.2016.10.002 – volume: 11 start-page: 5508 issue: 8 year: 2011 ident: 9470_CR54 publication-title: Appl Soft Comput J doi: 10.1016/j.asoc.2011.05.008 – volume: 99 start-page: 56 year: 2018 ident: 9470_CR47 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2018.01.019 – volume: 9 start-page: 84263 year: 2021 ident: 9470_CR53 publication-title: IEEE Access doi: 10.1109/ACCESS.2021.3085529 – volume: 17 start-page: 57 issue: 1 year: 2019 ident: 9470_CR3 publication-title: Int J Artif Intell – volume: 16 start-page: 1985 issue: 4 year: 2021 ident: 9470_CR16 publication-title: J Electr Eng Technol doi: 10.1007/s42835-021-00758-w – volume: 34 start-page: 871 issue: 3 year: 2022 ident: 9470_CR44 publication-title: J King Saud Univ Comput Inform Sci doi: 10.1016/j.jksuci.2020.01.013 – volume: 273 start-page: 831 issue: 3 year: 2019 ident: 9470_CR24 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2018.09.003 – volume: 272 start-page: 407 issue: 2 year: 2019 ident: 9470_CR51 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2018.03.001 – volume: 104 start-page: 98 year: 2019 ident: 9470_CR65 publication-title: Comput Oper Res doi: 10.1016/j.cor.2018.12.001 – volume: 53 start-page: 13224 issue: 11 year: 2023 ident: 9470_CR7 publication-title: Appl Intell doi: 10.1007/s10489-022-04201-z – volume: 7 start-page: 2332 year: 2021 ident: 9470_CR62 publication-title: Energy Rep doi: 10.1016/j.egyr.2021.04.042 – volume: 78 start-page: 3517 issue: 3 year: 2022 ident: 9470_CR14 publication-title: J Supercomput doi: 10.1007/s11227-021-03998-9 – volume: 6 start-page: 219 issue: 3 year: 1999 ident: 9470_CR56 publication-title: Struct Equ Model doi: 10.1080/10705519909540131 – year: 2021 ident: 9470_CR57 publication-title: Arab J Sci Eng doi: 10.1007/s13369-021-06026-3 – volume: 117 start-page: 699 issue: 3 year: 2013 ident: 9470_CR37 publication-title: Anesth Analg doi: 10.1213/ANE.0b013e31827f53d7 – volume: 46 start-page: 3213 issue: 4 year: 2021 ident: 9470_CR13 publication-title: Arab J Sci Eng doi: 10.1007/s13369-020-05141-x – year: 2021 ident: 9470_CR46 publication-title: Entropy doi: 10.3390/e23091189 – year: 2020 ident: 9470_CR55 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2019.112881 – volume: 8 start-page: 10 issue: 1 year: 1993 ident: 9470_CR25 publication-title: Stat Sci doi: 10.1214/ss/1177011077 – ident: 9470_CR31 doi: 10.1145/326619.326817 – year: 2021 ident: 9470_CR12 publication-title: PLoS ONE doi: 10.1371/journal.pone.0255703 – start-page: 475 volume-title: Modeling and optimization in science and technologies year: 2017 ident: 9470_CR28 doi: 10.1007/978-3-319-50920-4_19 – year: 2021 ident: 9470_CR10 publication-title: Comput Methods Appl Mech Eng doi: 10.1016/j.cma.2020.113609 – volume: 35 start-page: 19427 year: 2023 ident: 9470_CR15 publication-title: Neural Comput Appl doi: 10.1007/s00521-023-08772-x – year: 2006 ident: 9470_CR38 publication-title: BMC Health Serv Res doi: 10.1186/1472-6963-6-6 – volume: 274 start-page: 17 year: 2014 ident: 9470_CR60 publication-title: Inf Sci (n y) doi: 10.1016/j.ins.2014.02.123 – volume: 42 start-page: 2026 issue: 4 year: 2015 ident: 9470_CR17 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2014.10.008 – volume: 17 start-page: 1124 issue: 3 year: 2020 ident: 9470_CR64 publication-title: IEEE Trans Autom Sci Eng doi: 10.1109/TASE.2019.2942990 – ident: 9470_CR9 doi: 10.1515/jisys-2018-0094 – year: 2022 ident: 9470_CR29 publication-title: Mathematics doi: 10.3390/math10122152 – volume: 145 start-page: 197 year: 2018 ident: 9470_CR26 publication-title: Knowl Based Syst doi: 10.1016/j.knosys.2018.01.017 – volume: 59 start-page: 53 year: 2013 ident: 9470_CR48 publication-title: Adv Eng Softw doi: 10.1016/j.advengsoft.2013.03.004 – year: 2017 ident: 9470_CR43 publication-title: IOP Conf Ser: Mater Sci Eng doi: 10.1088/1757-899X/166/1/012024 – year: 2020 ident: 9470_CR66 publication-title: Optimization doi: 10.1080/02331934.2020.1829619 – volume: 78 start-page: 4799 issue: 4 year: 2022 ident: 9470_CR19 publication-title: J Supercomput doi: 10.1007/s11227-021-04050-6 – volume: 11 start-page: 445 issue: 3 year: 2021 ident: 9470_CR1 publication-title: Health Technol doi: 10.1007/s12553-021-00547-5 – year: 2020 ident: 9470_CR58 publication-title: Appl Soft Comput J doi: 10.1016/j.asoc.2020.106170 – ident: 9470_CR8 doi: 10.1080/15326349.2020.1742161 – volume: 80 start-page: 38 year: 2017 ident: 9470_CR59 publication-title: Comput Oper Res doi: 10.1016/j.cor.2016.11.016 – volume: 16 start-page: 209 year: 1996 ident: 9470_CR40 publication-title: Decis Support Syst doi: 10.1016/0167-9236(95)00011-9 – volume: 7 start-page: 83 issue: 6 year: 2014 ident: 9470_CR18 publication-title: Int J Hybrid Inform Technol doi: 10.14257/ijhit.2014.7.6.07 – volume: 141 start-page: 105007 year: 2022 ident: 9470_CR2 publication-title: Comput Biol Med doi: 10.1016/j.compbiomed.2021.105007 – volume: 26 start-page: 3293 issue: 7 year: 2022 ident: 9470_CR6 publication-title: Soft Comput doi: 10.1007/s00500-021-06665-6 – volume: 48 start-page: 61 year: 2010 ident: 9470_CR35 publication-title: Artif Intell – volume: 56 start-page: 199 issue: 3 year: 2012 ident: 9470_CR27 publication-title: Artif Intell Med doi: 10.1016/j.artmed.2012.09.001 – volume: 756 start-page: 1423 year: 2014 ident: 9470_CR63 publication-title: Adv Mater Res – volume: 79 start-page: 21265 year: 2023 ident: 9470_CR22 publication-title: J Supercomput doi: 10.1007/s11227-023-05444-4 – ident: 9470_CR20 – volume: 52 start-page: 427 year: 2014 ident: 9470_CR42 publication-title: J Biomed Inform doi: 10.1016/j.jbi.2014.08.007 – volume: 25 start-page: 2487 issue: 4 year: 2022 ident: 9470_CR32 publication-title: Cluster Comput doi: 10.1007/s10586-021-03490-2 – volume: 102 start-page: 1568 issue: 107113 year: 2021 ident: 9470_CR5 publication-title: Appl Soft Comput – volume: 16 start-page: 59 year: 2018 ident: 9470_CR34 publication-title: Oper Res Health Care doi: 10.1016/j.orhc.2018.01.004 – volume: 10 start-page: 13 issue: 1 year: 2007 ident: 9470_CR36 publication-title: Health Care Manag Sci doi: 10.1007/s10729-006-9005-4 – year: 2021 ident: 9470_CR23 publication-title: Konya J Eng Sci doi: 10.36306/konjes.904335 – volume: 53 start-page: 2265 issue: 3 year: 2020 ident: 9470_CR41 publication-title: Artif Intell Rev doi: 10.1007/s10462-019-09733-4 – volume: 154 start-page: 43 year: 2018 ident: 9470_CR39 publication-title: Knowl Based Syst doi: 10.1016/j.knosys.2018.05.009 – volume: 53 start-page: 1229 issue: 12 year: 2021 ident: 9470_CR30 publication-title: Educ Philos Theory doi: 10.1080/00131857.2020.1728732 – volume: 11 start-page: 319 issue: 4 year: 2019 ident: 9470_CR4 publication-title: Int J Reason-Based Intell Syst doi: 10.1504/ijris.2019.10025171 – year: 2022 ident: 9470_CR21 publication-title: Res Sq doi: 10.21203/rs.3.rs-822763/v1 – volume: 42 start-page: 1 issue: 1 year: 2010 ident: 9470_CR61 publication-title: Struct Multidiscip Optim doi: 10.1007/s00158-010-0496-8 – volume: 20 start-page: 392 issue: 3 year: 2011 ident: 9470_CR52 publication-title: Prod Oper Manag doi: 10.1111/j.1937-5956.2011.01221.x
SSID	ssj0021753
Score	2.4328134
Snippet	The patient admission scheduling problem (PASP) has been studied for many years as one of the most important scheduling problems in the health sector. The...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	5853
SubjectTerms	Algorithms Arithmetic Artificial Intelligence Benchmarks Comparative analysis Computational Intelligence Control Decision making Engineering Genetic algorithms Integer programming Mathematical analysis Mathematical Logic and Foundations Mechatronics Medical research Operators (mathematics) Optimization Optimization algorithms Parameter modification Patients Performance evaluation Robotics Scheduling Strategic management
SummonAdditionalLinks	– databaseName: ProQuest Central dbid: BENPR link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZg48CF8RSDgXLgBhHpI32cEKBNnKaJh7RblVcBaS-2wu_HadNNILEL1yaNqtqxPzvxZ4AL7Umppc5pKoyhYcoUlTq0dHfMBKElQONVs4m430-Gw3TgEm4Ld62ytomlodZTZXPk16iLfsAjBAg3sw9qu0bZ01XXQmMTmpapzG9A867bHzwuQy7HQ4mgAHEkOl9XNlMWz1nqE0bRZ1EMcWJG-U_XtMKbv45IS8_Ta_33m3dhx2FOclspyR5smMk-tOp-DsRt7wN4qjIMRhMMoIu3sa1vJFO0KWNXrEnE6HVaDhHEusRxshKhUVls1o1gqIyuy1a4E9ep5hBeet3n-wfqmi5QhbuxoMKgz4-kp_KAGz9KWCy8RHCd4rMcwZREPJXqFF27J9FCmVwjYNRScSbCPAh1cASNyXRijoFo6fFEMSbspU8Z5pKpOMJpsYeoIfRZG7z6f2fKMZLbxhijbMmlXMooQxllpYwy3obL5Tuzio9j7exOLZjM7c1FtpJKG65q0a6G_17tZP1qp7Dt42-prvV0oFHMP80ZbKmv4n0xP3ea-Q3-B-kK priority: 102 providerName: ProQuest
Title	Improved arithmetic optimization algorithm for patient admission scheduling problem
URI	https://link.springer.com/article/10.1007/s00500-023-09470-5 https://www.proquest.com/docview/3072356851
Volume	28
WOSCitedRecordID	wos001130364400006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1433-7479 dateEnd: 20241214 omitProxy: false ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: P5Z dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1433-7479 dateEnd: 20241214 omitProxy: false ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: K7- dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1433-7479 dateEnd: 20241214 omitProxy: false ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1433-7479 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: RSV dateStart: 19970401 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFD64zQd9cDoVp3PkwTcNpJf08qiyIQhjbCrDl9I0qQq7yFb9_Z60ab2ggr70oUlDOUnO9-VyvgNwIi0hpJApDWOlqBuyhArpark7phxXC6DxItmEPxgEk0k4NEFhq_K2e3kkmXvqKthNS5UwihhDcUniM8pr0EC483XChtH4rlpmGe1JJALIHRFwTajM9218hqN3jvnlWDRHm37zf_-5DVuGXZLzYjjswJqat6BZZm4gZiK3YPODDOEujIudBSUJLpyzx5mOayQL9CUzE6RJ4unDIi8iyHGJ0WIlscRBonfbCC6REbJ0ZDsxGWr24Lbfu7m8oibZAk1wFmY0Voj1nrCS1OHK9gLmx1YQcxniuxRJlEAeFcoQId0S6JlUKpEoSpFwFrup40pnH-rzxVwdAJHC4kHCWKwvewo3FSzxPazmW8gWXJu1wSptHiVGiVwnxJhGlYZybsMIbRjlNox4G06rb54LHY5fa3fKrozMnFxF6M1sh3tIMdtwVnbde_HPrR3-rfoRbNhopuJ6Twfq2fJFHcN68po9rZZdaFz0BsNRF2rXPsXnkN938_H7Bg0F5ZQ
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB58gV58i_W5Bz3p4uadHERELZVqEazgLe4rVdBW26r4p_yNziabFgV78-A1u1lI9puZbx_zDcCOcoRQQmU04VpTP2GSCuUbuTumPd8IoAVFsYmo0Yhvb5OrMfgsc2HMtcrSJ-aOWnWk2SM_QCy6XhAiQTh6fqGmapQ5XS1LaBSwqOuPd1yy9Q7PT3F-d123etY8qVFbVYBKhFufco1BLRSOzLxAu2HMIu7EPFAJPsuQLQgkDIlKMHY5Ak1QZwoZkRIyYNzPPF95OO44TPpeHBq7qkd0sMCzqpdIQZC1Yqi3STp5qp4RWmEUIyTFBVXEaPA9EA7Z7Y8D2TzOVef-2x-ah1nLqMlxYQILMKbbizBXVqsg1nktwXWxf6IV4d2H_v2Tyd4kHfSYTzYVlfDHVidvIsjkiVWcJVyhKZg9RdJDgCtzc79FbB2eZbj5k09bgYl2p61XgSjhBLFkjJsrrcLPBJNRiN0iBzmR77IKOOX8ptLqrZuyH4_pQCk6x0SKmEhzTKRBBfYG7zwXaiMje2-UQEit5-mlQxRUYL-E0rD599HWRo-2DdO15uVFenHeqK_DjIu_qLjAtAET_e6r3oQp-dZ_6HW3cpsgcPfXEPsC_8dDlA
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fS8MwED50iuiD06k4nZoH3zSY_m4fRR2KMoZT2VtpmlSFrRtb9e_30qbdFBXE1yYN5fLjvmvu-w7gWBicCy4SGkRSUjtgMeXCVnJ3TFq2EkBzimITXqfj9_tBd47Fn2e7l1eSBadBqTSl2dlYJGcV8U3JljCK_oZieOIx6izCko2RjErqu-89VSGX1qFEUIA4Ep2vps18P8Zn1zTDm1-uSHPP067__5s3YF2jTnJeLJNNWJBpA-plRQeiN3gD1ubkCbegV_xxkIJgQJ29DBXfkYzwjBlq8iaJBs-jvIkg9iVao5VEAheP-gtHMHRGV6YY70RXrtmGx_bVw8U11UUYaIy7M6ORRAzgciNOLEears-8yPAjRwT4LEFwxRFfBSJAV29wPLFkIhBACh47LLITyxbWDtTSUSp3gQhuOH7MWKSSQLmdcBZ7LnbzDEQRtsmaYJT2D2OtUK4KZQzCSls5t2GINgxzG4ZOE06qd8aFPsevvVvltIZ6r05DPOVMy3ERejbhtJzGWfPPo-39rfsRrHQv2-HdTed2H1ZNtFiRAdSCWjZ5kwewHL9nr9PJYb6EPwDsP-3y
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Improved+arithmetic+optimization+algorithm+for+patient+admission+scheduling+problem&rft.jtitle=Soft+computing+%28Berlin%2C+Germany%29&rft.au=Alawad%2C+Noor+Aldeen&rft.au=Abed-alguni%2C+Bilal+H.&rft.au=Saleh%2C+Israa+I.&rft.date=2024-04-01&rft.issn=1432-7643&rft.eissn=1433-7479&rft.volume=28&rft.issue=7-8&rft.spage=5853&rft.epage=5879&rft_id=info:doi/10.1007%2Fs00500-023-09470-5&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00500_023_09470_5
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-7643&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-7643&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-7643&client=summon