Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem

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.

[1]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.

[2]  Gunar E. Liepins,et al.  Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

[3]  J. Tanomaru,et al.  Staff scheduling by a genetic algorithm with heuristic operators , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[4]  L. Darrell Whitley,et al.  GENITOR II: a distributed genetic algorithm , 1990, J. Exp. Theor. Artif. Intell..

[5]  Heinz Mühlenbein,et al.  The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..

[6]  Kathryn A. Dowsland,et al.  Nurse scheduling with tabu search and strategic oscillation , 1998, Eur. J. Oper. Res..

[7]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[8]  Yuval Davidor,et al.  Epistasis Variance: A Viewpoint on GA-Hardness , 1990, FOGA.

[9]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[10]  Nashat Mansour,et al.  A Distributed Genetic Algorithm for Employee Staffing and Scheduling Problems , 1993, ICGA.

[11]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[12]  Kenneth A. De Jong,et al.  A Cooperative Coevolutionary Approach to Function Optimization , 1994, PPSN.

[13]  K. Al-Sultan,et al.  A Genetic Algorithm for the Set Covering Problem , 1996 .

[14]  Ralph R. Martin,et al.  Reducing Epistasis in Combinatorial Problems by Expansive Coding , 1993, ICGA.

[15]  Alice E. Smith,et al.  Genetic Optimization Using A Penalty Function , 1993, ICGA.

[16]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[17]  Kennetb A. De Genetic Algorithms Are NOT Function Optimizers , 1992 .

[18]  ANTHONY WREN,et al.  A genetic algorithm for public transport driver scheduling , 1995, Comput. Oper. Res..

[19]  Zbigniew Michalewicz,et al.  Handling Constraints in Genetic Algorithms , 1991, ICGA.

[20]  James C. Bean,et al.  A Genetic Algorithm for the Multiple-Choice Integer Program , 1997, Oper. Res..