Hybrid Model of Genetic Algorithms and Tabu Search Memory for Nurse Scheduling Systems

摘要

The main challenge of the nurse scheduling problem (NSP)is designing a nurse schedule that satisfies nurses preferences at minimal cost of violating the soft constraints. This makes the NSP an NP-hard problem with no perfect solution yet. In this study, two meta-heuristics procedures-genetic algorithm (GA) and tabu search (TS) memory-were applied for the development of an automatic hospital nurse scheduling system (GATS_NSS). The data collected from the nursing services unit of a Federal Medical Centre (FMC) in Nigeria with 151 nursing staffs was preprocessed and adopted for training the GATS_NSS. The system was implemented in Java for selection, evaluation, and genetic operators (crossover and mutation) of GA alongside the memory properties of TS. Nurse shift and ward allocation were optimized based on defined constraints of the case study hospital, and the results obtained showed that GAT_NSS returned an average accuracy of 94, 99 allocation rate, 0 duplication, 0.5 clash, and an average improvement in the computing time of 94 over the manual approach.