Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem

Aickelin, Uwe and Dowsland, Kathryn (2000) Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling, 3 (3). pp. 139-153. ISSN 1094-6136

WarningThere is a more recent version of this item available.
[img] PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (211kB)


There is considerable interest in the use of genetic algorithms to solve problems arising in the areas of scheduling and timetabling. However, the classical genetic algorithm paradigm is not well equipped to handle the conflict between objectives and constraints that typically occurs in such problems. In order to overcome this, successful implementations frequently make use of problem specific knowledge. This paper is concerned with the development of a GA for a nurse rostering problem at a major UK hospital. The structure of the constraints is used as the basis for a co-evolutionary strategy using co-operating sub-populations. Problem specific knowledge is also used to define a system of incentives and disincentives, and a complementary mutation operator. Empirical results based on 52 weeks of live data show how these features are able to improve an unsuccessful canonical GA to the point where it is able to provide a practical solution to the problem.

Item Type: Article
Additional Information: The original publication is available at www.springerlink.com
Keywords: manpower scheduling, genetic algorithms, heuristics, co-evolution
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Aickelin, Professor Uwe
Date Deposited: 14 Nov 2007 16:17
Last Modified: 31 May 2021 14:47
URI: https://eprints.nottingham.ac.uk/id/eprint/616

Available Versions of this Item

Actions (Archive Staff Only)

Edit View Edit View