Memetic Algorithms for Nurse Rostering

  • Ender Özcan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3733)

Abstract

Nurse rostering problems represent a subclass of scheduling problems that are hard to solve. The goal is finding high quality shift and resource assignments, satisfying the needs and requirements of employees as well as the employers in healthcare institutions. In this paper, a real case of a nurse rostering problem is introduced. Memetic Algorithms utilizing different type of promising genetic operators and a self adaptive violation directed hierarchical hill climbing method are presented based on a previously proposed framework.

Keywords

Mutation Operator Crossover Operator Night Shift Memetic Algorithm Soft Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahmad, J., Yamamoto, M., Ohuchi, A.: Evolutionary Algorithms for Nurse Scheduling Problem. In: Proc. of IEEE Congress on Evolutionary Computation, pp. 196–203 (2000)Google Scholar
  2. 2.
    Aickelin, U., Bull, L.: On the Application of Hierarchical Coevolutionary Genetic Algorithms: Recombination and Evaluation Partners. JASS 4(2), 2–17 (2003)Google Scholar
  3. 3.
    Aickelin, U., Dowsland, K.: An Indirect Genetic Algorithm for a Nurse Scheduling Problem. Computers & Operations Research 31(5), 761–778 (2003)CrossRefGoogle Scholar
  4. 4.
    Alkan, A., Ozcan, E.: Memetic Algorithms for Timetabling. In: Proc. of IEEE Congress on Evolutionary Computation, pp. 1796–1802 (2003)Google Scholar
  5. 5.
    Berrada, I., Ferland, J., Michelon, P.: A Multi-Objective Approach to Nurse Scheduling eith both Hard and Soft Constraints. Socio-Economic Planning Science 30, 183–193 (1996)CrossRefGoogle Scholar
  6. 6.
    Burke, E.K., De Causmaecker, P., Vanden Berghe, G.: A Hybrid Tabu Search Algorithm For the Nurse Rostering Problem. In: Proc. of the Second Asia-Pasific Conference on Simulated Evolution and Learning, Applications IV, vol. 1, pp. 187–194 (1998)Google Scholar
  7. 7.
    Burke, E.K., De Causmaecker, P., Vanden Berghe, G., Van Landeghem, H.: The State of the Art of Nurse Rostering. Journal of Scheduling 7, 441–499 (2004)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Burke, E.K., Cowling, P.I., De Causmaecker, P., Vanden Berghe, G.: A Memetic Approach to the Nurse Rostering Problem. Applied Intelligence 15, 199–214 (2001)MATHCrossRefGoogle Scholar
  9. 9.
    Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Handbook of metaheuristics. In: Hyper-heuristics: an emerging direction in modern search technology, ch. 16, pp. 457–474. Kluwer Academic Publisher, Dordrecht (2003)Google Scholar
  10. 10.
    Burke, E.K., De Causmaecker, P., Petrovic, S., Vanden Berghe, G.: Variable Neighbourhood Search for Nurse Rostering Problems. In: Resende, M.G.C., de Sousa, J.P. (eds.) Metaheuristics: Computer Decision-Making, ch. 7, pp. 153–172. Kluwer, Dordrecht (2003)Google Scholar
  11. 11.
    Burke, E., Soubeiga, E.: Scheduling Nurses Using a Tabu-Search Hyperheuristic. In: Proc. of the 1st MISTA, vol. 1, pp. 197–218 (2003)Google Scholar
  12. 12.
    Chun, A.H.W., Chan, S.H.C., Lam, G.P.S., Tsang, F.M.F., Wong, J., Yeung, D.W.M.: Nurse Rostering at the Hospital Authority of Hong Kong. In: Proc. of 17th National Conference on AAAI and 12th Conference on IAAI, pp. 951–956 (2000)Google Scholar
  13. 13.
    Downsland, K.: Nurse Scheduling with Tabu Search and Strategic Oscillation. European Journal of Operations Research 106(1198), 393–407 (1998)CrossRefGoogle Scholar
  14. 14.
    Duenas, A., Mort, N., Reeves, C., Petrovic, D.: Handling Preferences Using Genetic Algorithms for the Nurse Scheduling Problem. In: Proc.of the 1st MISTA, vol. 1, pp. 180–195 (2003)Google Scholar
  15. 15.
    Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput. 5(4), 691–703 (1976)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Fang, H.L.: Genetic Algorithms in Timetabling and Scheduling, PhD thesis, Department of Artificial Intelligence, University of Edinburgh, Scotland (1994)Google Scholar
  17. 17.
    Gendrau, M., Buzon, I., Lapierre, S., Sadr, J., Soriano, P.: A Tabu Search Heuristic to Generate Shift Schedules. In: Proc. of the 1st MISTA, vol. 2, pp. 526–528 (2003)Google Scholar
  18. 18.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)MATHGoogle Scholar
  19. 19.
    Holland, J.H.: Adaptation in Natural and Artificial Systems. Univ. Mich. Press, Ann Arbor (1975)Google Scholar
  20. 20.
    Han, L., Kendall, G.: Application of Genetic Algorithm Based Hyper-heuristic to Personnel Scheduling Problems. In: Proc. of the 1st MISTA, vol. 2, pp. 528–537 (2003)Google Scholar
  21. 21.
    Kawanaka, H., Yamamoto, K., Yoshikawa, T., Shinogi, T., Tsuruoka, S.: Genetic Algorithms with the Constraints for Nurse Scheduling Problem. In: Proc. of IEEE Congress on Evolutionary Computation (CEC), Seoul, pp. 1123–1130 (2001)Google Scholar
  22. 22.
    Krasnogor, N.: Studies on the Theory and Design Space of Memetic Algorithms. PhD Thesis, University of the West of England, Bristol, United Kingdom (2002)Google Scholar
  23. 23.
    Li, H., Lim, A., Rodrigues, B.: A Hybrid AI Approach for Nurse Rostering Problem. In: Proc. of the 2003 ACM Symposium on Applied Computing, pp. 730–735 (2003)Google Scholar
  24. 24.
    Moscato, P., Norman, M.G.: A Memetic Approach for the Traveling Salesman Problem Implementation of a Computational Ecology for Combinatorial Optimization on Message-Passing Systems. Parallel Computing and Transputer Applications, 177–186 (1992)Google Scholar
  25. 25.
    Ozcan, E., Alkan, A.: Solving Time Tabling Problem using Genetic Algorithms. In: Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling, pp. 104–107 (2002)Google Scholar
  26. 26.
    Ozcan, E., Ersoy, E.: Final Exam Scheduler - FES. In: 2005 IEEE CEC (2005) (to appear)Google Scholar
  27. 27.
    Ozcan, E.: Towards an XML based standard for Timetabling Problems: TTML, Multidisciplinary Scheduling: Theory and Applications, vol. 163(24). Springer, Heidelberg (2005)Google Scholar
  28. 28.
    Ozcan, E., Onbasioglu, E.: Genetic Algorithms for Parallel Code Optimization. In: Proc. of 2004 IEEE Congress on Evolutionary Computation, vol. 2, pp. 1775–1781 (2004)Google Scholar
  29. 29.
    Radcliffe, N.J., Surry, P.D.: Formal memetic algorithms. In: Fogarty, T.C. (ed.) AISB-WS 1994. LNCS, vol. 865, pp. 1–16. Springer, Heidelberg (1994)Google Scholar
  30. 30.
    Ross, P., Corne, D., Fang, H.-L.: Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation. In: Proc. of PPSN III, pp. 556–565 (1994)Google Scholar
  31. 31.
    Ross, P., Corne, D., Fang, H.-L.: Fast Practical Evolutionary Timetabling. In: Proc. of AISB Workshop on Evolutionary Computation, pp. 250–263 (1994)Google Scholar
  32. 32.
    De Werra, D.: An introduction to timetabling. European Journal of Operations Research 19, 151–162 (1985)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ender Özcan
    • 1
  1. 1.Department of Computer EngineeringYeditepe UniversityKayışdağı, İstanbulTurkey

Personalised recommendations