Memetic Algorithms for Nurse Rostering [chapter]

Ender Özcan
2005 Lecture Notes in Computer Science  
Nurse rostering problems represent a subclass of scheduling problems that are hard to solve. The goal is finding high quality shift and resource assignments, satisfying the needs and requirements of employees as well as the employers in healthcare institutions. In this paper, a real case of a nurse rostering problem is introduced. Memetic Algorithms utilizing different type of promising genetic operators and a self adaptive violation directed hierarchical hill climbing method are presented based on a previously proposed framework.
doi:10.1007/11569596_51 fatcat:46vxqvvlqfd6tecoz2pvajyu24