Exploiting problem structure in a genetic algorithm approach to a nurse rostering problemTools 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  There is a more recent version of this item available.
Official URL: http://springerlink.metapress.com/content/111647/
AbstractThere 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.
Available Versions of this Item
Actions (Archive Staff Only)
|
Tools
Tools
![[thumbnail of 00jofs_nurse.pdf]](https://eprints.nottingham.ac.uk/style/images/fileicons/application_pdf.png "00jofs_nurse.pdf")
