Can I read Harmony Search Algorithm for Patient Admission Scheduling Problem on EtoBox?

Harmony Search Algorithm for Patient Admission Scheduling Problem by Iyad Abu Doush; Mohammed Azmi Al-Betar; Mohammed A. Awadallah; Abdelaziz I. Hammouri; Ra’ed M. Al-Khatib; Saba ElMustafa; Habes ALkhraisat is a Computer Science article available to read on EtoBox.

What is Harmony Search Algorithm for Patient Admission Scheduling Problem about?

## 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 ra

Who reads Harmony Search Algorithm for Patient Admission Scheduling Problem?

Author

Iyad Abu Doush; Mohammed Azmi Al-Betar; Mohammed A. Awadallah; Abdelaziz I. Hammouri; Ra’ed M. Al-Khatib; Saba ElMustafa; Habes ALkhraisat

Publisher

Walter de Gruyter GmbH

Published

2018

Language

EN

Field

Computer Science (Physical Sciences)