Title: A hybrid tabu search algorithm for automatically assigning patients to beds
Authors: Demeester, Peter ×
Souffriau, Wouter
De Causmaecker, Patrick
Vanden Berghe, Greet #
Issue Date: Jan-2010
Publisher: Burgverlag
Series Title: Artificial Intelligence in Medicine vol:48 issue:1 pages:61-70
Abstract: Summary


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.

Results and conclusion

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 1 h of calculation time.
ISSN: 0933-3657
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Computer Science, Campus Kulak Kortrijk
Centre for Industrial Management / Traffic & Infrastructure
Informatics Section
Faculty of Science, Campus Kulak Kortrijk
Computer Science Technology TC, Technology Campuses Ghent and Aalst
Technologiecluster Computerwetenschappen
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science