A Component Based Heuristic Search Method with Adaptive Perturbations

Jingpeng Li, Uwe Aickelin, Edmund Burke

School of Computer Science and Information Technology, University of Nottingham | Published : 2006


Nurse rostering is a complex scheduling problem that affects hospital personnel on a daily basis all over the world. This paper presents a new component-based approach with adaptive perturbations, for a nurse scheduling problem arising at a major UK hospital. The main idea behind this technique is to decompose a schedule into its components (i.e. the allocated shift pattern of each nurse), and then mimic a natural evolutionary process on these components to iteratively deliver better schedules. The worthiness of all components in the schedule has to be continuously demonstrated in order for them to remain there. This demonstration employs a dynamic evaluation function which evaluates how wel..

View full abstract

University of Melbourne Researchers