An indirect genetic algorithm for a nurse-scheduling problem

Computers and Operations Research

Volumn 31, Issue 5, 2004, Pages 761-778

  Aickelin, Uwe ^a   Dowsland, Kathryn A ^b  

^a UNIVERSITY OF BRADFORD   (United Kingdom)

^b Gower Optimal Algorithms Ltd   (United Kingdom)

Author keywords

Genetic algorithms; Heuristics; Manpower scheduling

Indexed keywords

DECODING; ENCODING (SYMBOLS); GENETIC ALGORITHMS; HOSPITALS; SCHEDULING;

CROSSOVER OPERATORS; NURSE-SCHEDULING PROBLEM;

OPERATIONS RESEARCH;

ALGORITHM; HOSPITAL SECTOR;

EID: 0942291224     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00034-0     Document Type: Article

References (29)

1. Michalewicz Z. A survey of constraint handling techniques in evolutionary computation methods. Proceedings of the Fourth Annual Conference on Evolutionary Programming, San Diego, California, 1995. p. 135-55.
2. Hung R. Hospital nurse-scheduling. Journal of Nursing Administration 1995;1:21-3.
3. Sitompul D, Randhawa S. Nurse scheduling models: a state-of-the-art review. Journal of the Society of Health Systems 1990;2:62-72.
4. Bradley D, Martin J. Continuous personnel scheduling algorithms: a literature review. Journal of the Society for Health Systems 1990;2:8-23.
5. Easton F, Mansour N. A distributed Genetic Algorithm for employee staffing and scheduling problems. In: Forrest S, editor. Proceedings of the Fifth International Reference on Genetic Algorithms. San Mateo: Morgan Kaufmann Publishers, 1993. p. 360-7.
6. Tanomaru J. Staff scheduling by a Genetic Algorithm with heuristic operators. Proceedings of the IEEE Conference on Evolutionary Computation, New York 1995. p. 456-61.
7. Fuller E. Tackling scheduling problems using integer programming. Master Thesis, University of Wales, Swansea, United Kingdom, 1998.
8. Dowsland KA. Nurse scheduling with Tabu Search and strategic oscillation. European Journal of Operational Research 1998;106:393-407.
9. Aickelin U, Dowsland KA. Exploiting problem structure in a Genetic Algorithms approach to a nurse rostering problem. Journal of Scheduling 2000;31:139-53.
10. Davis L. Adapting operator probabilities in Genetic Algorithms. In: Schaffer J, editor. Proceedings of the Third International Reference on Genetic Algorithms and their Applications, San Mateo: Morgan Kaufmann Publishers, 1989. p. 61-7.
11. Palmer C, Kershenbaum A. Representing trees in Genetic Algorithms. Proceedings of the First IEEE International Conference on Evolutionary Computation, New York 1994. p. 379-84.
12. Dowsland KA, Thompson JM. Nurse scheduling with knapsacks, networks and Tabu Search. Journal of the Operational Research Society 2000; 825-33.
13. Holland J. Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press, 1976.
14. Fogel D. Evolutionary computation: the fossil record. New York: IEEE Press, 1998.
15. De Jong K. Genetic Algorithms are NOT function optimisers. In: Whitley D, editor. Foundations of Genetic Algorithms 2. San Mateo: Morgan Kaufmann Publishers, 1993. p. 5-17.
16. Deb K. Genetic algorithms for function optimisation. Genetic Algorithms and Soft Computing 1996:4-31.
17. Bäck T. Applications of evolutionary algorithms, 5th ed. Germany: Dortmund, 1993.
18. Chaiyaratana N. Zalzala A. Recent developments in evolutionary and genetic algorithms: theory and applications. In: Fleming P, Zalzala S, editors. Genetic algorithms in engineering systems 2: innovations and applications. IEEE Proceedings. Letchworth: Omega Print & Design, 1997. p. 270-7.
19. Beasley J, Chu P. A genetic algorithm for the set covering problem. European Journal of Operational Research 1996;94:392-404.
20. Goldberg D. Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison-Wesley, 1989.
21. Fang H-L, Ross P, Corne D. A promising genetic algorithm approach to job-shop scheduling, rescheduling and open shop scheduling problems. In: Forrest S, editor. Proceedings of the Fifth International Reference on Genetic Algorithms. San Mateo: Morgan Kaufmann Publishers, 1993. p. 375-82.
22. Podgorelec V, Kokol P. Genetic algorithm based system for patient scheduling in highly constrained situations. Journal of Medical Systems 1997;21:417-27.
23. Corne D, Odgen J. Evolutionary optimisation of methodist preaching timetables. In: Burke E, Carter M, editors. Practise and theory of automated timetabling II. Heidelberg: Springer Verlag, 1998. p. 143-55.
24. Goldberg D, Lingle R. Alleles, loci, and the travelling salesman problem. In: Grefenstette J, editor. Proceedings of the First International Reference on Genetic Algorithms and their Applications. Hillsdale, NJ: Lawrence Erlbaum Associates Publishers, 1985. p. 154-9.
25. Syswerda G. Schedule optimisation using genetic algorithms. In: Davis L, editor. Handbook of genetic algorithms. London: International Thomson Computer Press, 1996. p. 335-49.
26. Reeves C. Hybrid genetic algorithms for bin-packing and related problems. Annals of OR 1996;63:371-96.
27. Davis L. Applying adaptive algorithms to epistatic domains. Proceedings of the Ninth International Joint Reference on Artificial Intelligence 1985;1:162-4.
28. Herbert E. Genetic algorithms for bin packing problems. PhD Dissertation, University of Wales, Swansea, United Kingdom, 1998.
29. Aickelin U. An indirect genetic algorithm for set covering problems. Journal of the Operational Research Society, Special Issue on Local Search, 2002, in print.