Advertisement

A Simple Evolutionary Algorithm with Self-adaptation for Multi-objective Nurse Scheduling

  • Dario Landa-silva
  • Khoi N. Le
Part of the Studies in Computational Intelligence book series (SCI, volume 136)

Summary

We present a multi-objective approach to tackle a real-world nurse scheduling problem using an evolutionary algorithm. The aim is to generate a few good quality non-dominated schedules so that the decision-maker can select the most appropriate one. Our approach is designed around the premise of ‘satisfying individual nurse preferences’ which is of practical significance in our problem. We use four objectives to measure the quality of schedules in a way that is meaningful to the decision-maker. One objective represents staff satisfaction and is set as a target. The other three objectives, which are subject to optimisation, represent work regulations and workforce demand. Our algorithm incorporates a self-adaptive decoder to handle hard constraints and a re-generation strategy to encourage production of new genetic material. Our results show that our multi-objective approach produces good quality schedules that satisfy most of the nurses’ preferences and comply with work regulations and workforce demand. The contribution of this paper is in presenting a multi-objective evolutionary algorithm to nurse scheduling in which increasing overall nurses’ satisfaction is built into the self-adaptive solution method.

Keywords

Multi-objective nurse scheduling evolutionary algorithms decoder constraints  

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ernst, A.T., Jiang, H., Krishnamoorthy, M., Owens, B., Sier, D.: An annotated bibliography of personnel scheduling and rostering. Annals of Operations Research 127, 21–144 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. European Journal of Operational Research 153, 3–27 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Burke, E.K., De Causmaecker, P., Vanden Berghe, G.: The state of the art of nurse scheduling. Journal of Scheduling 7, 441–499 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems: a bibliographic survey. European Journal of Operational Research 151, 447–460 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Authur, J.F., Ravindran, A.: A multiple objective nurse scheduling model. AIIE Transactions 13(1), 55–60 (1981)Google Scholar
  6. 6.
    Berrada, I., Ferland, J.A., Michelon, P.: A multi-objective approach to nurse scheduling with both hard and soft constraints. Socio-Economic Planning Sciences 30(3), 183–193 (1996)CrossRefGoogle Scholar
  7. 7.
    Landa Silva, J.D., Burke, E.K., Petrovic, S.: An introduction to multiobjective metaheuristics for scheduling and timetabling. In: Gandibleux, X., Sevaux, M., Sorensen, K., T’kindt, V. (eds.) Metaheuristic for multiobjective optimisation. Lecture Notes in Economics and Mathematical Systems, vol. 535, pp. 91–129 (2004)Google Scholar
  8. 8.
    Jaszkiewicz, A.: A metaheuristic approach to multiple objective nurse scheduling. Foundations of Computing and Decision Sciences 22(3), 169–183 (1997)zbMATHGoogle Scholar
  9. 9.
    Czyzak, P., Jaszkiewicz, A.: Pareto simulated annealing - a metaheuristic for multiple-objective combinatorial optimization. Journal of Multicriteria Decision Analysis 7(1), 34–47 (1998)zbMATHCrossRefGoogle Scholar
  10. 10.
    Beddoe, G.R., Petrovic, S.: Combining case-based reasoning with tabu search for personnel rostering problems. Computer Science Technical Report No. NOTTCS-TR-2004-5, The University of Nottingham (2004)Google Scholar
  11. 11.
    Beddoe, G.R., Petrovic, S.: Enhancing case-based reasoning for personnel rostering with selected tabu search concepts. The Journal of The Operational Research Society (to appear, 2007)Google Scholar
  12. 12.
    Valenzuela, C.L.: A simple evolutionary algorithm for multi-objective optimization (seamo). In: IEEE World Congress on Computational Intelligence (WCCI 2002): Congress on Evolutionary Computation (CEC 2002), pp. 717–722. IEEE press, Los Alamitos (2002)Google Scholar
  13. 13.
    Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation 3(4), 257–271 (1999)CrossRefGoogle Scholar
  14. 14.
    Oliver, I.M., Smith, D.J., Holland, J.R.C.: A study of permutation crossover operators on the traveling salesman problem. In: Genetic Algorithms and their Application: Proceedings of the Second International Conference on Genetic Algorithms, pp. 224–230 (1987)Google Scholar
  15. 15.
    Mumford, C.L.: Simple population replacement strategies for a steady-state multi-objective evolutionary algorithm. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 1389–1400. Springer, Heidelberg (2004)Google Scholar
  16. 16.
    Meyer-Nieberg, S., Beyer, H.G.: Self-adaptation in evolutionary algorithms. In: Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.) Parameter Setting in Evolutionary Algorithms, vol. 54, pp. 47–76. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  17. 17.
    Sareni, B., Regnier, J., Roboam, X.: Recombination and self-adaptation in multi-objective genetic algorithms. In: Liardet, P., Collet, P., Fonlupt, C., Lutton, E., Schoenauer, M. (eds.) EA 2003. LNCS, vol. 2936, pp. 115–126. Springer, Heidelberg (2004)Google Scholar
  18. 18.
    Hinterding, R., Michalewicz, Z., Eiben, A.E.: Adaptation in evolutionary computation: a survey. In: 1997 IEEE International Conference on Evolutionary Computation, pp. 65–69 (1997)Google Scholar
  19. 19.
    Bäck, T.: Self-adaptation in genetic algorithms. In: Varela, F.J., Bourgine, P. (eds.) Proceedings of the 1st European Conference on Artificial Life (ECAL 1992), pp. 227–235. MIT Press, Cambridge (1992)Google Scholar
  20. 20.
    Angeline, P.J.: Adaptive and aelf-adaptive evolutionary computations. In: Palaniswami, M., Attikiouzel, Y. (eds.) Computational Intelligence: A Dynamic Systems Perspective, pp. 152–163. IEEE Press, Los Alamitos (1995)Google Scholar
  21. 21.
    Le, K.N.: An evolutionary algorithm for multi-objective nurse scheduling. Master Thesis, School of Computer Science and IT, The University of Nottingham (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Dario Landa-silva
    • 1
  • Khoi N. Le
    • 1
  1. 1.School of Computer ScienceThe University of NottinghamUK

Personalised recommendations