'Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem'
Aickelin, Uwe; Dowsland, Kathryn
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.
Aickelin, U., & Dowsland, K. (2000). 'Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem'
|Journal Article Type||Article|
|Publication Date||Jan 1, 2000|
|Deposit Date||Oct 24, 2007|
|Publicly Available Date||Oct 24, 2007|
|Journal||Journal of Scheduling, 3 (3)|
|Peer Reviewed||Peer Reviewed|
|Keywords||manpower scheduling, genetic algorithms, heuristics, co-evolution|
|Additional Information||The original publication is available at www.springerlink.com|
You might also like
Measuring behavioural change of players in public goods game
Adaptive Data Communication Interface: A User-Centric Visual Data Interpretation Framework
Identifying candidate risk factors for prescription drug side effects using causal contrast set mining
Indebted households profiling: a knowledge discovery from database approach