Journal article

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

Uwe Aickelin, Kathryn Dowsland

Journal of Scheduling | Wiley | Published : 2000


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 (GA) paradigm is not well equipped to handle the conflict between objectives and constraints that typically occur 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 U.K. hospital. The structure of the constraints is used as the basis for a co-evolutionary strategy using co-operating subpopulations. Problem-specific knowledge is also used to define a system ..

View full abstract

University of Melbourne Researchers

Citation metrics