Late acceptance hill climbing algorithm for solving patient admission scheduling problem

This article tackles a patient admission scheduling using Late Acceptance Hill Climbing Algorithm (LAHC). The LAHC algorithm is among the newly proposed metaheuristic-based algorithm which belongs to the one-point solution technique. Patient admission scheduling is a complex combinatorial optimizati...

Full description

Saved in:
Bibliographic Details
Published inKnowledge-based systems Vol. 145; pp. 197 - 206
Main Authors Bolaji, Asaju La’aro, Bamigbola, Akeem Femi, Shola, Peter Bamidele
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.04.2018
Elsevier Science Ltd
Subjects
Online AccessGet full text
ISSN0950-7051
1872-7409
DOI10.1016/j.knosys.2018.01.017

Cover

Abstract This article tackles a patient admission scheduling using Late Acceptance Hill Climbing Algorithm (LAHC). The LAHC algorithm is among the newly proposed metaheuristic-based algorithm which belongs to the one-point solution technique. Patient admission scheduling is a complex combinatorial optimization problem which have been proven to belongs to class of NP-hard problem in almost all its variations. This problem is concerns with assigning a set of patients arriving for medical services in the hospital to a set of rooms, timeslots and beds subject to satisfying a set of predefined constraints. The proposed adaptation of LAHC to the patient admission scheduling named LAHC-based PAS comes in two stages: the first stage involves generating of initial feasible solution using the room oriented-based approach (ROP), while the second stage utilizes three neighbourhood structures which are embedded within the component of LAHC-based PAS to further enhances the initial solution generated at the initial stage. The proposed LAHC method is evaluated using the standard benchmark dataset. The experimental results shows that the proposed method is an effective technique for tackling the PAS problem. It is observed that the method outperform many of the existing techniques when compared with the state-of-the-arts.
AbstractList This article tackles a patient admission scheduling using Late Acceptance Hill Climbing Algorithm (LAHC). The LAHC algorithm is among the newly proposed metaheuristic-based algorithm which belongs to the one-point solution technique. Patient admission scheduling is a complex combinatorial optimization problem which have been proven to belongs to class of NP-hard problem in almost all its variations. This problem is concerns with assigning a set of patients arriving for medical services in the hospital to a set of rooms, timeslots and beds subject to satisfying a set of predefined constraints. The proposed adaptation of LAHC to the patient admission scheduling named LAHC-based PAS comes in two stages: the first stage involves generating of initial feasible solution using the room oriented-based approach (ROP), while the second stage utilizes three neighbourhood structures which are embedded within the component of LAHC-based PAS to further enhances the initial solution generated at the initial stage. The proposed LAHC method is evaluated using the standard benchmark dataset. The experimental results shows that the proposed method is an effective technique for tackling the PAS problem. It is observed that the method outperform many of the existing techniques when compared with the state-of-the-arts.
Author Shola, Peter Bamidele
Bamigbola, Akeem Femi
Bolaji, Asaju La’aro
Author_xml – sequence: 1
  givenname: Asaju La’aro
  orcidid: 0000-0002-1322-3479
  surname: Bolaji
  fullname: Bolaji, Asaju La’aro
  email: lbasaju@fuwukari.edu.ng
  organization: Department of Computer Science, Faculty of Pure and Applied Sciences, Federal University Wukari, Wukari, Taraba State P. M. B. 1020, Nigeria
– sequence: 2
  givenname: Akeem Femi
  surname: Bamigbola
  fullname: Bamigbola, Akeem Femi
  organization: Department of Computer Science, Faculty of Communication and Information Sciences, University of Ilorin, Ilorin, Nigeria
– sequence: 3
  givenname: Peter Bamidele
  surname: Shola
  fullname: Shola, Peter Bamidele
  organization: Department of Computer Science, Faculty of Communication and Information Sciences, University of Ilorin, Ilorin, Nigeria
BookMark eNqFkE-LFDEQxYOs4OzqN_DQ4LnHqu5Op9uDIIt_Fga8KHgL6aSykzGdjElmYb-9GceTBxceFFS9V0X9rtlViIEYe42wRcDx7WH7M8T8mLcd4LQFrBLP2AYn0bVigPmKbWDm0Arg-IJd53wAgK7DacN-7FShRmlNx6KCpmbvvG-0d-viwn2j_H1MruzXxsbU5Ogfzt2jKo5CaZRZXc4uhibrPZmT_zNMcfG0vmTPrfKZXv2tN-z7p4_fbr-0u6-f724_7Frd90NpNcfeCtEj8Bn7ZaQBF1BcDUBG47wMaMbOjByXyZraNcYKNS7WGj5yslN_w95c9ta7v06UizzEUwr1pOyAdwLHUczV9e7i0inmnMhK7Ur9IoaSlPMSQZ5JyoO8kJRnkhKwStTw8E_4mNyq0uNTsfeXGNX3HxwlmXXFpsm4RLpIE93_F_wGzIGT6Q
CitedBy_id crossref_primary_10_3390_math11030687
crossref_primary_10_1016_j_ejor_2024_02_009
crossref_primary_10_1016_j_cie_2023_109857
crossref_primary_10_1016_j_sciaf_2023_e01720
crossref_primary_10_1007_s10479_023_05769_6
crossref_primary_10_1007_s00500_023_09470_5
crossref_primary_10_1016_j_compbiomed_2021_105007
crossref_primary_10_3390_asi1040044
crossref_primary_10_3390_math11234813
crossref_primary_10_1111_itor_12931
crossref_primary_10_1016_j_knosys_2020_106562
crossref_primary_10_1155_2022_5819813
crossref_primary_10_1080_01605682_2021_1954485
crossref_primary_10_1109_ACCESS_2024_3365734
crossref_primary_10_1007_s12553_021_00547_5
crossref_primary_10_1111_itor_12737
crossref_primary_10_1016_j_compbiomed_2022_105850
crossref_primary_10_1016_j_asoc_2024_111602
crossref_primary_10_1016_j_jksuci_2020_01_013
crossref_primary_10_3390_computers11050063
crossref_primary_10_1007_s11227_023_05444_4
Cites_doi 10.1016/j.cor.2016.11.016
10.1016/j.ejor.2007.01.062
10.1016/j.knosys.2012.09.007
10.1007/s10479-008-0413-3
10.1016/j.knosys.2015.05.011
10.1016/j.ins.2014.10.004
10.1016/j.artmed.2012.09.001
10.1287/mnsc.16.6.B384
10.1007/s11761-007-0012-1
10.1016/j.cor.2011.01.007
10.1016/j.knosys.2016.08.018
10.1007/s10845-013-0770-x
10.1016/j.knosys.2017.09.026
10.1007/0-306-48056-5_16
10.1515/jisys-2014-0002
10.1016/j.knosys.2016.03.010
10.1016/j.jocs.2014.04.002
10.1016/j.jbi.2014.08.007
10.1007/s00521-011-0794-0
10.1016/j.knosys.2010.02.003
10.1007/s10732-011-9192-0
10.1016/j.knosys.2014.02.014
10.1016/j.ejor.2013.10.050
10.1016/j.artmed.2009.09.001
10.1016/j.knosys.2017.01.026
ContentType Journal Article
Copyright 2018 Elsevier B.V.
Copyright Elsevier Science Ltd. Apr 1, 2018
Copyright_xml – notice: 2018 Elsevier B.V.
– notice: Copyright Elsevier Science Ltd. Apr 1, 2018
DBID AAYXX
CITATION
7SC
8FD
E3H
F2A
JQ2
L7M
L~C
L~D
DOI 10.1016/j.knosys.2018.01.017
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Library & Information Sciences Abstracts (LISA)
Library & Information Science Abstracts (LISA)
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Library and Information Science Abstracts (LISA)
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-7409
EndPage 206
ExternalDocumentID 10_1016_j_knosys_2018_01_017
S095070511830025X
GroupedDBID --K
--M
.DC
.~1
0R~
1B1
1~.
1~5
4.4
457
4G.
5VS
7-5
71M
77K
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAXUO
AAYFN
ABAOU
ABBOA
ABIVO
ABJNI
ABMAC
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
AXJTR
BJAXD
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
IHE
J1W
JJJVA
KOM
LG9
LY7
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
RIG
ROL
RPZ
SDF
SDG
SDP
SES
SPC
SPCBC
SST
SSV
SSW
SSZ
T5K
WH7
XPP
ZMT
~02
~G-
29L
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ABXDB
ACNNM
ACRPL
ACVFH
ADCNI
ADJOM
ADMUD
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AFXIZ
AGCQF
AGQPQ
AGRNS
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
BNPGV
CITATION
FEDTE
FGOYB
G-2
HLZ
HVGLF
HZ~
R2-
SBC
SET
SEW
SSH
UHS
WUQ
7SC
8FD
E3H
EFKBS
F2A
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c334t-c513f773105913b6e41b0a5a40edc19b41d62d651b8fda40ddf7a6bffd565ef83
IEDL.DBID AIKHN
ISSN 0950-7051
IngestDate Fri Jul 25 05:54:34 EDT 2025
Thu Apr 24 22:51:41 EDT 2025
Tue Jul 01 04:37:54 EDT 2025
Fri Feb 23 02:18:39 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Patient admission scheduling
Local search-based
Metaheuristic
Timetabling
Late acceptance hill climbing
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c334t-c513f773105913b6e41b0a5a40edc19b41d62d651b8fda40ddf7a6bffd565ef83
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-1322-3479
PQID 2052716679
PQPubID 2035257
PageCount 10
ParticipantIDs proquest_journals_2052716679
crossref_citationtrail_10_1016_j_knosys_2018_01_017
crossref_primary_10_1016_j_knosys_2018_01_017
elsevier_sciencedirect_doi_10_1016_j_knosys_2018_01_017
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2018-04-01
2018-04-00
20180401
PublicationDateYYYYMMDD 2018-04-01
PublicationDate_xml – month: 04
  year: 2018
  text: 2018-04-01
  day: 01
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Knowledge-based systems
PublicationYear 2018
Publisher Elsevier B.V
Elsevier Science Ltd
Publisher_xml – name: Elsevier B.V
– name: Elsevier Science Ltd
References Chen, Zhan, Zhang, Liu, Liu (bib0005) 2010
Vermeulen, Bohte, Somefun, La Poutré (bib0030) 2007; 1
Burke, Bykov (bib0034) 2012
Hutzschenreuter, Bosman, Blonk-Altena, van Aarle, La Poutré (bib0033) 2008
Granja, Almada-Lobo, Janela, Seabra, Mendes (bib0003) 2014; 52
Ceschia, Schaerf (bib0029) 2012; 56
Ehteram, Karami, Mousavi, El-Shafie, Amini (bib0006) 2017; 122
Hussein, Sahran, Abdullah (bib0009) 2016; 101
Demeester, Souffriau, De Causmaecker, Berghe (bib0021) 2010; 48
Bolaji, Khader, Al-Betar, Awadallah, Thomas (bib0035) 2012
Vancroonenburg, Goossens, Spieksma (bib0001) 2011
Zhang, Mistry, Neoh, Lim (bib0008) 2016; 111
Zarandi, Hemmati, Davari, Turksen (bib0014) 2013; 37
Burke, Bykov (bib0022) 2008
Pacheco, García, Álvarez (bib0013) 2014; 62
Bolaji, Michael, Shola (bib0007) 2017
Ceschia, Schaerf (bib0017) 2011; 38
Chien, Tseng, Chen (bib0004) 2008; 189
Range, Lusby, Larsen (bib0016) 2014; 235
Turhan, Bilgen (bib0031) 2017; 80
Kıran, İşcan, Gündüz (bib0036) 2013; 23
Al-Obeidat, Belacel, Carretero, Mahanti (bib0010) 2010; 23
Burke, Kendall, Newall, Hart, Ross, Schulenburg (bib0028) 2003
Bilgin, Demeester, Misir, Vancroonenburg, Berghe (bib0020) 2012; 18
Yuan, Zhang, Shao (bib0026) 2015; 26
Fei, Chu, Meskens (bib0015) 2009; 166
Bilgin, Demeester, Vanden Berghe (bib0002) 2008
Verstichel, Berghe (bib0023) 2009
Carrasco, Pham, Gallego, Gortázar, Martí, Duarte (bib0012) 2015; 85
Kolesar (bib0032) 1970; 16
Bolaji, Khader, Al-Betar, Awadallah (bib0037) 2014; 5
Hammouri, Alrifai (bib0019) 2014; 70
Shao, Pi, Shao (bib0011) 2017; 137
Bolaji, Khader, Al-Betar, Awadallah (bib0038) 2015; 24
Goerler, Schulte, Voß (bib0024) 2013
Turky, Sabar, Sattar, Song (bib0027) 2016
Tierney (bib0025) 2013
Kifah, Abdullah (bib0018) 2015; 295
Bilgin (10.1016/j.knosys.2018.01.017_bib0020) 2012; 18
Kolesar (10.1016/j.knosys.2018.01.017_bib0032) 1970; 16
Bilgin (10.1016/j.knosys.2018.01.017_bib0002) 2008
Goerler (10.1016/j.knosys.2018.01.017_bib0024) 2013
Bolaji (10.1016/j.knosys.2018.01.017_bib0038) 2015; 24
Granja (10.1016/j.knosys.2018.01.017_bib0003) 2014; 52
Burke (10.1016/j.knosys.2018.01.017_bib0034) 2012
Hussein (10.1016/j.knosys.2018.01.017_bib0009) 2016; 101
Hammouri (10.1016/j.knosys.2018.01.017_bib0019) 2014; 70
Vermeulen (10.1016/j.knosys.2018.01.017_bib0030) 2007; 1
Pacheco (10.1016/j.knosys.2018.01.017_bib0013) 2014; 62
Ceschia (10.1016/j.knosys.2018.01.017_bib0029) 2012; 56
Hutzschenreuter (10.1016/j.knosys.2018.01.017_bib0033) 2008
Chien (10.1016/j.knosys.2018.01.017_bib0004) 2008; 189
Shao (10.1016/j.knosys.2018.01.017_bib0011) 2017; 137
Carrasco (10.1016/j.knosys.2018.01.017_bib0012) 2015; 85
Zarandi (10.1016/j.knosys.2018.01.017_bib0014) 2013; 37
Al-Obeidat (10.1016/j.knosys.2018.01.017_bib0010) 2010; 23
Range (10.1016/j.knosys.2018.01.017_bib0016) 2014; 235
Demeester (10.1016/j.knosys.2018.01.017_bib0021) 2010; 48
Burke (10.1016/j.knosys.2018.01.017_bib0028) 2003
Chen (10.1016/j.knosys.2018.01.017_bib0005) 2010
Turhan (10.1016/j.knosys.2018.01.017_bib0031) 2017; 80
Vancroonenburg (10.1016/j.knosys.2018.01.017_sbref0001) 2011
Bolaji (10.1016/j.knosys.2018.01.017_bib0007) 2017
Yuan (10.1016/j.knosys.2018.01.017_bib0026) 2015; 26
Zhang (10.1016/j.knosys.2018.01.017_bib0008) 2016; 111
Verstichel (10.1016/j.knosys.2018.01.017_bib0023) 2009
Kıran (10.1016/j.knosys.2018.01.017_bib0036) 2013; 23
Fei (10.1016/j.knosys.2018.01.017_bib0015) 2009; 166
Kifah (10.1016/j.knosys.2018.01.017_bib0018) 2015; 295
Bolaji (10.1016/j.knosys.2018.01.017_bib0035) 2012
Tierney (10.1016/j.knosys.2018.01.017_bib0025) 2013
Turky (10.1016/j.knosys.2018.01.017_bib0027) 2016
Burke (10.1016/j.knosys.2018.01.017_bib0022) 2008
Bolaji (10.1016/j.knosys.2018.01.017_bib0037) 2014; 5
Ehteram (10.1016/j.knosys.2018.01.017_bib0006) 2017; 122
Ceschia (10.1016/j.knosys.2018.01.017_bib0017) 2011; 38
References_xml – volume: 62
  start-page: 28
  year: 2014
  end-page: 37
  ident: bib0013
  article-title: Enhancing variable neighbourhood search by adding memory: application to a real logistic problem
  publication-title: Knowl.Based Syst.
– volume: 85
  start-page: 256
  year: 2015
  end-page: 264
  ident: bib0012
  article-title: Tabu search for the max–mean dispersion problem
  publication-title: Knowl. Based Syst.
– volume: 80
  start-page: 38
  year: 2017
  end-page: 49
  ident: bib0031
  article-title: Mixed integer programming based heuristics for the patient admission scheduling problem
  publication-title: Comput. Oper. Res.
– start-page: 337
  year: 2017
  end-page: 346
  ident: bib0007
  article-title: Optimization of office-space allocation problem using artificial bee colony algorithm
  publication-title: Proceedings of the International Conference in Swarm Intelligence
– start-page: 21
  year: 2013
  end-page: 27
  ident: bib0025
  article-title: Late acceptance hill climbing for the liner shipping fleet repositioning problem
  publication-title: Proceedings of the Fourteenth EU/ME Workshop
– volume: 137
  start-page: 163
  year: 2017
  end-page: 181
  ident: bib0011
  article-title: Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms
  publication-title: Knowl. Based Syst.
– volume: 18
  start-page: 401
  year: 2012
  end-page: 434
  ident: bib0020
  article-title: One hyper-heuristic approach to two timetabling problems in health care
  publication-title: J. Heuristics
– volume: 23
  start-page: 9
  year: 2013
  end-page: 21
  ident: bib0036
  article-title: The analysis of discrete artificial bee colony algorithm with neighbourhood operator on traveling salesman problem
  publication-title: Neural comput. appl.
– start-page: 457
  year: 2003
  end-page: 474
  ident: bib0028
  article-title: Hyper-heuristics: an emerging direction in modern search technology
  publication-title: Int. Series Oper. Res. Manag. Sci.
– volume: 166
  start-page: 91
  year: 2009
  end-page: 108
  ident: bib0015
  article-title: Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria
  publication-title: Annals of Oper. Res.
– volume: 24
  start-page: 37
  year: 2015
  end-page: 54
  ident: bib0038
  article-title: A hybrid nature-inspired artificial bee colony algorithm for uncapacitated examination timetabling problems
  publication-title: J. Intell. Syst.
– volume: 37
  start-page: 480
  year: 2013
  end-page: 489
  ident: bib0014
  article-title: Capacitated location-routing problem with time windows under uncertainty
  publication-title: Knowl. Based Syst.
– start-page: 173
  year: 2013
  end-page: 183
  ident: bib0024
  article-title: An application of late acceptance hill-climbing to the traveling purchaser problem
  publication-title: Computational Logistics
– volume: 235
  start-page: 252
  year: 2014
  end-page: 264
  ident: bib0016
  article-title: A column generation approach for solving the patient admission scheduling problem
  publication-title: Eur. J. Oper. Res.
– volume: 111
  start-page: 248
  year: 2016
  end-page: 267
  ident: bib0008
  article-title: Intelligent facial emotion recognition using moth-firefly optimization
  publication-title: Knowledge-Based Systems
– year: 2008
  ident: bib0022
  article-title: A late acceptance strategy in hill-climbing for exam timetabling problems
  publication-title: Proceedings of the PATAT 2008 Conference
– volume: 16
  start-page: B
  year: 1970
  end-page: 384
  ident: bib0032
  article-title: A Markovian model for hospital admission scheduling
  publication-title: Manag. Sci.
– year: 2011
  ident: bib0001
  article-title: On the complexity of the patient assignment problem
  publication-title: Techical report
– start-page: 457
  year: 2009
  end-page: 478
  ident: bib0023
  article-title: A late acceptance algorithm for the lock scheduling problem
  publication-title: Logistik Management
– volume: 26
  start-page: 159
  year: 2015
  end-page: 168
  ident: bib0026
  article-title: A late acceptance hill-climbing algorithm for balancing two-sided assembly lines with multiple constraints
  publication-title: J. Intell. Manuf.
– volume: 38
  start-page: 1452
  year: 2011
  end-page: 1463
  ident: bib0017
  article-title: Local search and lower bounds for the patient admission scheduling problem
  publication-title: Comput. Oper. Res.
– start-page: 1
  year: 2010
  end-page: 5
  ident: bib0005
  article-title: A genetic algorithm for the optimization of admission scheduling strategy in hospitals
  publication-title: IEEE Congress on Evolutionary Computation (CEC), 2010
– year: 2012
  ident: bib0034
  article-title: The late acceptance hill-climbing heuristic
  publication-title: Technical Report
– volume: 295
  start-page: 573
  year: 2015
  end-page: 585
  ident: bib0018
  article-title: An adaptive non-linear great deluge algorithm for the patient-admission problem
  publication-title: Inf. Sci.
– volume: 56
  start-page: 199
  year: 2012
  end-page: 205
  ident: bib0029
  article-title: Modeling and solving the dynamic patient admission scheduling problem under uncertainty
  publication-title: Artif. Intell. Med.
– volume: 189
  start-page: 1234
  year: 2008
  end-page: 1253
  ident: bib0004
  article-title: An evolutionary approach to rehabilitation patient scheduling: A case study
  publication-title: Eur. J. Oper. Res.
– start-page: 163
  year: 2016
  end-page: 174
  ident: bib0027
  article-title: Parallel late acceptance hill-climbing algorithm for the Google machine reassignment problem
  publication-title: Proceedings of the Australasian Joint Conference on Artificial Intelligence
– start-page: 29
  year: 2012
  end-page: 31
  ident: bib0035
  article-title: The effect of neighbourhood structures on examination timetabling with artificial bee colony
  publication-title: Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling,(PATAT 2012)
– volume: 5
  start-page: 809
  year: 2014
  end-page: 818
  ident: bib0037
  article-title: University course timetabling using hybridized artificial bee colony with hill climbing optimizer
  publication-title: J. Comput. Sci.
– volume: 70
  start-page: 413
  year: 2014
  end-page: 421
  ident: bib0019
  article-title: Investigating biogeography-based optimization for patient admission scheduling problems.
  publication-title: J. Theor.Appl. Inf. Technol.
– volume: 52
  start-page: 427
  year: 2014
  end-page: 437
  ident: bib0003
  article-title: An optimization based on simulation approach to the patient admission scheduling problem using a linear programming algorithm
  publication-title: J. Biomed. Inf.
– start-page: 45
  year: 2008
  end-page: 52
  ident: bib0033
  article-title: Agent-based patient admission scheduling in hospitals
  publication-title: Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multiagent Systems: Industrial Track
– volume: 122
  start-page: 26
  year: 2017
  end-page: 38
  ident: bib0006
  article-title: Optimizing dam and reservoirs operation based model utilizing shark algorithm approach
  publication-title: Knowledge-Based Systems
– volume: 48
  start-page: 61
  year: 2010
  end-page: 70
  ident: bib0021
  article-title: A hybrid tabu search algorithm for automatically assigning patients to beds
  publication-title: Artif. Intell. Med.
– volume: 101
  start-page: 114
  year: 2016
  end-page: 134
  ident: bib0009
  article-title: A fast scheme for multilevel thresholding based on a modified bees algorithm
  publication-title: Knowl. Based Syst.
– year: 2008
  ident: bib0002
  article-title: A hyperheuristic approach to the patient admission scheduling problem
  publication-title: Techical Report, KaHo Sint-Lieven, Gent
– volume: 23
  start-page: 418
  year: 2010
  end-page: 426
  ident: bib0010
  article-title: Differential evolution for learning the classification method proaftn
  publication-title: Knowl. Based Syst.
– volume: 1
  start-page: 185
  year: 2007
  end-page: 196
  ident: bib0030
  article-title: Multi-agent Pareto appointment exchanging in hospital patient scheduling
  publication-title: Serv. Oriented Comput.Appl.
– volume: 80
  start-page: 38
  year: 2017
  ident: 10.1016/j.knosys.2018.01.017_bib0031
  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
– volume: 189
  start-page: 1234
  issue: 3
  year: 2008
  ident: 10.1016/j.knosys.2018.01.017_bib0004
  article-title: An evolutionary approach to rehabilitation patient scheduling: A case study
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2007.01.062
– year: 2008
  ident: 10.1016/j.knosys.2018.01.017_bib0022
  article-title: A late acceptance strategy in hill-climbing for exam timetabling problems
– start-page: 163
  year: 2016
  ident: 10.1016/j.knosys.2018.01.017_bib0027
  article-title: Parallel late acceptance hill-climbing algorithm for the Google machine reassignment problem
– start-page: 21
  year: 2013
  ident: 10.1016/j.knosys.2018.01.017_bib0025
  article-title: Late acceptance hill climbing for the liner shipping fleet repositioning problem
– volume: 37
  start-page: 480
  year: 2013
  ident: 10.1016/j.knosys.2018.01.017_bib0014
  article-title: Capacitated location-routing problem with time windows under uncertainty
  publication-title: Knowl. Based Syst.
  doi: 10.1016/j.knosys.2012.09.007
– start-page: 45
  year: 2008
  ident: 10.1016/j.knosys.2018.01.017_bib0033
  article-title: Agent-based patient admission scheduling in hospitals
– volume: 166
  start-page: 91
  issue: 1
  year: 2009
  ident: 10.1016/j.knosys.2018.01.017_bib0015
  article-title: Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria
  publication-title: Annals of Oper. Res.
  doi: 10.1007/s10479-008-0413-3
– volume: 85
  start-page: 256
  year: 2015
  ident: 10.1016/j.knosys.2018.01.017_bib0012
  article-title: Tabu search for the max–mean dispersion problem
  publication-title: Knowl. Based Syst.
  doi: 10.1016/j.knosys.2015.05.011
– volume: 295
  start-page: 573
  year: 2015
  ident: 10.1016/j.knosys.2018.01.017_bib0018
  article-title: An adaptive non-linear great deluge algorithm for the patient-admission problem
  publication-title: Inf. Sci.
  doi: 10.1016/j.ins.2014.10.004
– volume: 56
  start-page: 199
  issue: 3
  year: 2012
  ident: 10.1016/j.knosys.2018.01.017_bib0029
  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: 16
  start-page: B
  issue: 6
  year: 1970
  ident: 10.1016/j.knosys.2018.01.017_bib0032
  article-title: A Markovian model for hospital admission scheduling
  publication-title: Manag. Sci.
  doi: 10.1287/mnsc.16.6.B384
– volume: 1
  start-page: 185
  issue: 3
  year: 2007
  ident: 10.1016/j.knosys.2018.01.017_bib0030
  article-title: Multi-agent Pareto appointment exchanging in hospital patient scheduling
  publication-title: Serv. Oriented Comput.Appl.
  doi: 10.1007/s11761-007-0012-1
– year: 2008
  ident: 10.1016/j.knosys.2018.01.017_bib0002
  article-title: A hyperheuristic approach to the patient admission scheduling problem
  publication-title: Techical Report, KaHo Sint-Lieven, Gent
– volume: 38
  start-page: 1452
  issue: 10
  year: 2011
  ident: 10.1016/j.knosys.2018.01.017_bib0017
  article-title: Local search and lower bounds for the patient admission scheduling problem
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2011.01.007
– start-page: 29
  year: 2012
  ident: 10.1016/j.knosys.2018.01.017_bib0035
  article-title: The effect of neighbourhood structures on examination timetabling with artificial bee colony
– volume: 111
  start-page: 248
  year: 2016
  ident: 10.1016/j.knosys.2018.01.017_bib0008
  article-title: Intelligent facial emotion recognition using moth-firefly optimization
  publication-title: Knowledge-Based Systems
  doi: 10.1016/j.knosys.2016.08.018
– volume: 26
  start-page: 159
  issue: 1
  year: 2015
  ident: 10.1016/j.knosys.2018.01.017_bib0026
  article-title: A late acceptance hill-climbing algorithm for balancing two-sided assembly lines with multiple constraints
  publication-title: J. Intell. Manuf.
  doi: 10.1007/s10845-013-0770-x
– volume: 137
  start-page: 163
  year: 2017
  ident: 10.1016/j.knosys.2018.01.017_bib0011
  article-title: Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms
  publication-title: Knowl. Based Syst.
  doi: 10.1016/j.knosys.2017.09.026
– year: 2012
  ident: 10.1016/j.knosys.2018.01.017_bib0034
  article-title: The late acceptance hill-climbing heuristic
– start-page: 457
  year: 2009
  ident: 10.1016/j.knosys.2018.01.017_bib0023
  article-title: A late acceptance algorithm for the lock scheduling problem
– start-page: 337
  year: 2017
  ident: 10.1016/j.knosys.2018.01.017_bib0007
  article-title: Optimization of office-space allocation problem using artificial bee colony algorithm
– start-page: 457
  year: 2003
  ident: 10.1016/j.knosys.2018.01.017_bib0028
  article-title: Hyper-heuristics: an emerging direction in modern search technology
  publication-title: Int. Series Oper. Res. Manag. Sci.
  doi: 10.1007/0-306-48056-5_16
– volume: 24
  start-page: 37
  issue: 1
  year: 2015
  ident: 10.1016/j.knosys.2018.01.017_bib0038
  article-title: A hybrid nature-inspired artificial bee colony algorithm for uncapacitated examination timetabling problems
  publication-title: J. Intell. Syst.
  doi: 10.1515/jisys-2014-0002
– volume: 101
  start-page: 114
  year: 2016
  ident: 10.1016/j.knosys.2018.01.017_bib0009
  article-title: A fast scheme for multilevel thresholding based on a modified bees algorithm
  publication-title: Knowl. Based Syst.
  doi: 10.1016/j.knosys.2016.03.010
– start-page: 173
  year: 2013
  ident: 10.1016/j.knosys.2018.01.017_bib0024
  article-title: An application of late acceptance hill-climbing to the traveling purchaser problem
– volume: 5
  start-page: 809
  issue: 5
  year: 2014
  ident: 10.1016/j.knosys.2018.01.017_bib0037
  article-title: University course timetabling using hybridized artificial bee colony with hill climbing optimizer
  publication-title: J. Comput. Sci.
  doi: 10.1016/j.jocs.2014.04.002
– start-page: 1
  year: 2010
  ident: 10.1016/j.knosys.2018.01.017_bib0005
  article-title: A genetic algorithm for the optimization of admission scheduling strategy in hospitals
– volume: 52
  start-page: 427
  year: 2014
  ident: 10.1016/j.knosys.2018.01.017_bib0003
  article-title: An optimization based on simulation approach to the patient admission scheduling problem using a linear programming algorithm
  publication-title: J. Biomed. Inf.
  doi: 10.1016/j.jbi.2014.08.007
– year: 2011
  ident: 10.1016/j.knosys.2018.01.017_sbref0001
  article-title: On the complexity of the patient assignment problem
– volume: 70
  start-page: 413
  issue: 3
  year: 2014
  ident: 10.1016/j.knosys.2018.01.017_bib0019
  article-title: Investigating biogeography-based optimization for patient admission scheduling problems.
  publication-title: J. Theor.Appl. Inf. Technol.
– volume: 23
  start-page: 9
  issue: 1
  year: 2013
  ident: 10.1016/j.knosys.2018.01.017_bib0036
  article-title: The analysis of discrete artificial bee colony algorithm with neighbourhood operator on traveling salesman problem
  publication-title: Neural comput. appl.
  doi: 10.1007/s00521-011-0794-0
– volume: 23
  start-page: 418
  issue: 5
  year: 2010
  ident: 10.1016/j.knosys.2018.01.017_bib0010
  article-title: Differential evolution for learning the classification method proaftn
  publication-title: Knowl. Based Syst.
  doi: 10.1016/j.knosys.2010.02.003
– volume: 18
  start-page: 401
  issue: 3
  year: 2012
  ident: 10.1016/j.knosys.2018.01.017_bib0020
  article-title: One hyper-heuristic approach to two timetabling problems in health care
  publication-title: J. Heuristics
  doi: 10.1007/s10732-011-9192-0
– volume: 62
  start-page: 28
  year: 2014
  ident: 10.1016/j.knosys.2018.01.017_bib0013
  article-title: Enhancing variable neighbourhood search by adding memory: application to a real logistic problem
  publication-title: Knowl.Based Syst.
  doi: 10.1016/j.knosys.2014.02.014
– volume: 235
  start-page: 252
  issue: 1
  year: 2014
  ident: 10.1016/j.knosys.2018.01.017_bib0016
  article-title: A column generation approach for solving the patient admission scheduling problem
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2013.10.050
– volume: 48
  start-page: 61
  issue: 1
  year: 2010
  ident: 10.1016/j.knosys.2018.01.017_bib0021
  article-title: A hybrid tabu search algorithm for automatically assigning patients to beds
  publication-title: Artif. Intell. Med.
  doi: 10.1016/j.artmed.2009.09.001
– volume: 122
  start-page: 26
  year: 2017
  ident: 10.1016/j.knosys.2018.01.017_bib0006
  article-title: Optimizing dam and reservoirs operation based model utilizing shark algorithm approach
  publication-title: Knowledge-Based Systems
  doi: 10.1016/j.knosys.2017.01.026
SSID ssj0002218
Score 2.3389988
Snippet This article tackles a patient admission scheduling using Late Acceptance Hill Climbing Algorithm (LAHC). The LAHC algorithm is among the newly proposed...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 197
SubjectTerms Algorithms
Combinatorial analysis
Health care delivery
Health services
Heuristic
Heuristic methods
Hospital administration
Hospital systems
Late acceptance hill climbing
Local search-based
Metaheuristic
Patient admission scheduling
Patient admissions
Scheduling
Scheduling algorithms
Timetabling
Title Late acceptance hill climbing algorithm for solving patient admission scheduling problem
URI https://dx.doi.org/10.1016/j.knosys.2018.01.017
https://www.proquest.com/docview/2052716679
Volume 145
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8QwDLbgWFh4I97KwFquaZq0jAiBjucCSLdVecLBPRAcAwu_HbtNkUBISEhd2iRVazv2Z8uxAfZ9QNCROplkmfXooOgyMVrwRKlggzPaS06nka-uVe8uP-_L_gwct2dhKK0y6v5Gp9faOj7pRmp2nweD7g2CA5RXQsiCLHd_FuYycahkB-aOzi56118KOcvqMB_NT2hBe4KuTvN6Gk9e36luNy_r-p1157JfLdQPXV0boNMlWIjIkR01H7cMM368AottVwYWN-kq9C8RPjJtKV-FWMoo3s_scDBCJ_ie6eH95GUwfRgxhKsMJY8iCiyWV2XaId8pgMbQ60UrNKwHm6Yza3B3enJ73Eti_4TECpFPEyu5CEUhCEJxYZTPuUm11HnqneWHJudOZU4hN8rg8KlzodDKhOAQ5flQinXojCdjvwEstej25SbIUqjc82CksUJSDMr6QuhyE0RLs8rG4uLU42JYtVlkj1VD6YooXaUcr2ITkq9Vz01xjT_mFy07qm9CUqH-_2PlTsu9Km5SGpcZuov4F1v_fvE2zNNdk8uzA53py5vfRZgyNXswe_DB96IwfgL9M-oh
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDI5gHODCG_EmB65lTdO05Ygm0IBtF5i0W5QnDMaGYBy48Nux2xQEQpqE1FMeVWs79mfLsQk5dh5AR2xFlCTGgYOiikgrzqIs88ZbrZxgeBu528va_fRqIAZzpFXfhcG0yqD7K51eausw0gzUbD4Ph80bAAcgr4iQOVruwTxZSAXPMa_v5OM7zyNJyiAfro5weX1_rkzyehxPXt-xajcryuqdZd-yP-3TL01dmp-LVbIccCM9qz5tjcy58TpZqXsy0HBEN8igA-CRKoPZKshQitF-akbDJ3CB76ga3U1ehtP7JwpglYLcYTyBhuKqVFngOobPKPi8YING5WTVcmaT9C_Ob1vtKHRPiAzn6TQygnGf5xwBFOM6cynTsRIqjZ017FSnzGaJzYAXhbcwaq3PVaa9t4DxnC_4FmmMJ2O3TWhswOlLtRcFz1LHvBbacIERKONyroodwmuaSRNKi2OHi5Gsc8geZEVpiZSWMYMn3yHR167nqrTGjPV5zQ75Q0QkaP8ZO_dr7slwRHFeJOAswl_s_vvFR2SxfdvtyM5l73qPLOFMldWzTxrTlzd3AIBlqg9LgfwE-nHq7A
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=Late+acceptance+hill+climbing+algorithm+for+solving+patient+admission+scheduling+problem&rft.jtitle=Knowledge-based+systems&rft.au=Bolaji%2C+Asaju+La%E2%80%99aro&rft.au=Bamigbola%2C+Akeem+Femi&rft.au=Shola%2C+Peter+Bamidele&rft.date=2018-04-01&rft.issn=0950-7051&rft.volume=145&rft.spage=197&rft.epage=206&rft_id=info:doi/10.1016%2Fj.knosys.2018.01.017&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_knosys_2018_01_017
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0950-7051&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0950-7051&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0950-7051&client=summon