Skip to main content
SpringerLink
Log in

Nurse Rostering Using Modified Harmony Search Algorithm

  • Conference paper
Swarm, Evolutionary, and Memetic Computing (SEMCCO 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7077))

Included in the following conference series:

Abstract

In this paper, a Harmony Search Algorithm (HSA) is adapted for Nurse Rostering Problem (NRP). HSA is a global optimization method derived from a musical improvisation process which has been successfully tailored for several optimization domains. NRP is a hard combinatorial scheduling problem of assigning given shifts to given nurses. Using a dataset established by International Nurse Rostering Competition 2010 of sprint dataset that has 10-early, 10-late, 10-hidden, and 3-hint. The proposed method achieved competitively comparable results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aickelin, U., Dowsland, K.: An indirect genetic algorithm for a nurse-scheduling problem. Computers & Operations Research 31(5), 76–778 (2004)

    Article  MATH  Google Scholar 

  2. Al-Betar, M., Khader, A.: A hybrid harmony search for university course timetabling. In: Proceedings of the 4nd Multidisciplinary Conference on Scheduling: Theory and Applications (MISTA 2009), Dublin, Ireland, pp. 10–12 (August 2009)

    Google Scholar 

  3. Al-Betar, M., Khader, A.: A harmony search algorithm for university course timetabling. Annals of Operations Research, 1–29 (2008)

    Google Scholar 

  4. Al-Betar, M., Khader, A., Nadi, F.: Selection mechanisms in memory consideration for examination timetabling with harmony search. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 1203–1210. ACM (2010)

    Google Scholar 

  5. Alatas, B.: Chaotic harmony search algorithms. Applied Mathematics and Computation 216(9), 2687–2699 (2010)

    Article  MATH  Google Scholar 

  6. Bilgin, B., De Causmaecker, P., Rossie, B., Vanden Berghe, G.: Local search neighbourhoods for dealing with a novel nurse rostering model. Annals of Operations Research, 1–25 (2011)

    Google Scholar 

  7. Brusco, M., Jacobs, L.: Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations. European Journal of Operational Research 86(2), 249–261 (1995)

    Article  MATH  Google Scholar 

  8. Burke, E., Cowling, P., De Causmaecker, P., Berghe, G.: A memetic approach to the nurse rostering problem. Applied Intelligence 15(3), 199–214 (2001)

    Article  MATH  Google Scholar 

  9. Burke, E., Curtois, T., Post, G., Qu, R., Veltman, B.: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research 188(2), 330–341 (2008)

    Article  MATH  Google Scholar 

  10. Burke, E., Curtois, T., Qu, R., Berghe, G.: A scatter search methodology for the nurse rostering problem. Journal of the Operational Research Society 61(11), 1667–1679 (2009)

    Article  Google Scholar 

  11. Burke, E., De Causmaecker, P., Berghe, G., Van Landeghem, H.: The state of the art of nurse rostering. Journal of Scheduling 7(6), 441–499 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Burke, E., De Causmaecker, P., Vanden Berghe, G.: A hybrid tabu search algorithm for the nurse rostering problem. Simulated Evolution and Learning, 187–194 (1999)

    Google Scholar 

  13. Burke, E., Li, J., Qu, R.: A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems. European Journal of Operational Research 203(2), 484–493 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems - a bibliographic survey. European Journal of Operational Research 151(3), 447–460 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Geem, Z.: Optimal cost design of water distribution networks using harmony search. Engineering Optimization 38(3), 259–277 (2006)

    Article  Google Scholar 

  16. Geem, Z.: Harmony search applications in industry. Soft Computing Applications in Industry, 117–134 (2008)

    Google Scholar 

  17. Geem, Z., Kim, J., Loganathan, G.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)

    Article  Google Scholar 

  18. Geem, Z., Lee, K., Park, Y.: Application of harmony search to vehicle routing. American Journal of Applied Sciences 2(12), 1552–1557 (2005)

    Article  Google Scholar 

  19. Geem, Z., Sim, K.: Parameter-setting-free harmony search algorithm. Applied Mathematics and Computation, 3881–3889 (2010)

    Google Scholar 

  20. Geem, Z., Tseng, C., Park, Y.: Harmony search for generalized orienteering problem: best touring in china. Advances in Natural Computation, 741–750 (2005)

    Google Scholar 

  21. Gutjahr, W., Rauner, M.: An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria. Computers & Operations Research 34(3), 642–666 (2007)

    Article  MATH  Google Scholar 

  22. Kaveh, A., Talatahari, S.: Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures. Computers & Structures 87(5-6), 267–283 (2009)

    Article  Google Scholar 

  23. Lee, K., Geem, Z.: A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Computer Methods in Applied Mechanics and Engineering 194(36-38), 3902–3933 (2005)

    Article  MATH  Google Scholar 

  24. Lee, K., Geem, Z., Lee, S., Bae, K.: The harmony search heuristic algorithm for discrete structural optimization. Engineering Optimization 37(7), 663–684 (2005)

    Article  MathSciNet  Google Scholar 

  25. Maenhout, B., Vanhoucke, M.: An electromagnetic meta-heuristic for the nurse scheduling problem. Journal of Heuristics 13(4), 359–385 (2007)

    Article  Google Scholar 

  26. Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Applied Mathematics and Computation 188(2), 1567–1579 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  27. Millar, H., Kiragu, M.: Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming. European Journal of Operational Research 104(3), 582–592 (1998)

    Article  MATH  Google Scholar 

  28. Pan, Q., Suganthan, P., Liang, J., Tasgetiren, M.: A local-best harmony search algorithm with dynamic subpopulations. Engineering Optimization 42(2), 101–117 (2010)

    Article  Google Scholar 

  29. Pan, Q., Suganthan, P., Tasgetiren, M., Liang, J.: A self-adaptive global best harmony search algorithm for continuous optimization problems. Applied Mathematics and Computation 216(3), 830–848 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  30. Wren, A.: Scheduling, Timetabling and Rosteringa Special Relationship? In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 46–75. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  31. Zhao, S., Suganthan, P., Pan, Q., Tasgetiren, M.: Dynamic multi-swarm particle swarm optimizer with harmony search. Expert Systems with Applications, 3735–3742 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Sciences, Universiti Sains Malaysia (USM), 11800, Pulau, Pinang, Malaysia

    Mohammed A. Awadallah, Ahamad Tajudin Khader, Mohammed Azmi Al-Betar & Asaju La’aro Bolaji

  2. Department of Computer Science, Al-zaytoonah University, Amman, Jordan, Malaysia

    Mohammed Azmi Al-Betar

Authors
  1. Mohammed A. Awadallah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ahamad Tajudin Khader
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohammed Azmi Al-Betar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Asaju La’aro Bolaji
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, IIT, Delhi, India

    Bijaya Ketan Panigrahi

  2. School of Electrical and Electronic Engineering, Nanyang Technological University, 639798, Singapore

    Ponnuthurai Nagaratnam Suganthan

  3. Department of Electronics and Telecommunications, Jadavpur University, 700032, Kolkata, India

    Swagatam Das

  4. ANITS, Visakhapatnam, India

    Suresh Chandra Satapathy

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Awadallah, M.A., Khader, A.T., Al-Betar, M.A., Bolaji, A.L. (2011). Nurse Rostering Using Modified Harmony Search Algorithm. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2011. Lecture Notes in Computer Science, vol 7077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27242-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27242-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27241-7

  • Online ISBN: 978-3-642-27242-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation