Header menu link for other important links
X
Harmony Search Algorithm for Patient Admission Scheduling Problem
I. Abu Doush, , M.A. Awadallah, A.I. Hammouri, R.M. Al-Khatib, S. Elmustafa, H. Alkhraisat
Published in De Gruyter
2020
Volume: 29
   
Issue: 1
Pages: 540 - 553
Abstract
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. © 2020 Walter de Gruyter GmbH, Berlin/Boston.
About the journal
JournalData powered by TypesetJournal of Intelligent Systems
PublisherData powered by TypesetDe Gruyter
ISSN03341860