A hybrid evolutionary approach to the nurse rostering problem

Citation

Bai R, Burke E, Kendall G, Li J & McCollum B (2010) A hybrid evolutionary approach to the nurse rostering problem. IEEE Transactions on Evolutionary Computation, 14 (4), pp. 580-590. https://doi.org/10.1109/TEVC.2009.2033583

Abstract
Nurse rostering is an important search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle these constraints within genetic algorithm frameworks. In this paper, we investigate an extension of a previously proposed stochastic ranking method, which has demonstrated superior performance to other constraint handling techniques when tested against a set of constrained optimization benchmark problems. An initial experiment on nurse rostering problems demonstrates that the stochastic ranking method is better at finding feasible solutions, but fails to obtain good results with regard to the objective function. To improve the performance of the algorithm, we hybridize it with a recently proposed simulated annealing hyper-heuristic (SAHH) within a local search and genetic algorithm framework. Computational results show that the hybrid algorithm performs better than both the genetic algorithm with stochastic ranking and the SAHH alone. The hybrid algorithm also outperforms the methods in the literature which have the previously best known results.

Keywords
constraint handling; genetic algorithms; search problems; simulated annealing; stochastic processes

Journal
IEEE Transactions on Evolutionary Computation: Volume 14, Issue 4