Title
A hybrid tabu search algorithm for automatically assigning patients to beds.
Abstract
We describe a patient admission scheduling algorithm that supports the operational decisions in a hospital. It involves efficiently assigning patients to beds in the appropriate departments, taking into account the medical needs of the patients as well as their preferences, while keeping the number of patients in the different departments balanced.Due to the combinatorial complexity of the admission scheduling problem, there is a need for an algorithm that intelligently assists the admission scheduler in taking decisions fast. To this end a hybridized tabu search algorithm is developed to tackle the admission scheduling problem. For testing, we use a randomly generated data set. The performance of the algorithm is compared with an integer programming approach.The metaheuristic allows flexible modelling and presents feasible solutions even when disrupted by the user at an early stage in the calculation. The integer programming approach is not able to find a solution in 1h of calculation time.
Year
DOI
Venue
2010
10.1016/j.artmed.2009.09.001
Artificial Intelligence In Medicine
Keywords
Field
DocType
admission scheduling problem,appropriate department,different department,hybrid tabu search algorithm,decision support,admission scheduler,patient admission scheduling algorithm,hybridized tabu search algorithm,assigning patient,admission scheduling,calculation time,integer programming approach,metaheuristic,combinatorial complexity,scheduling algorithm
Guided Local Search,Scheduling (computing),Computer science,Integer programming,Artificial intelligence,Metaheuristic,Mathematical optimization,Job shop scheduling,Fair-share scheduling,Algorithm,Dynamic priority scheduling,Tabu search,Machine learning
Journal
Volume
Issue
ISSN
48
1
1873-2860
Citations 
PageRank 
References 
32
1.41
10
Authors
4
Name
Order
Citations
PageRank
P. Demeester1935.90
Wouter Souffriau275028.50
Patrick De Causmaecker395655.12
Greet Vanden Berghe4137177.56