Welcome to the InfoSci Platform
Reference Hub7
Harmony Search with Greedy Shuffle for Nurse Rostering

Harmony Search with Greedy Shuffle for Nurse Rostering

Mohammed A. Awadallah, Ahamad Tajudin Khader, Mohammed Azmi Al-Betar, Asaju La’aro Bolaji
Copyright: © 2012 |Volume: 3 |Issue: 2 |Pages: 21
ISSN: 1947-928X|EISSN: 1947-9298|EISBN13: 9781466613669|DOI: 10.4018/jncr.2012040102
Cite Article Cite Article

MLA

Awadallah, Mohammed A., et al. "Harmony Search with Greedy Shuffle for Nurse Rostering." IJNCR vol.3, no.2 2012: pp.22-42. http://doi.org/10.4018/jncr.2012040102

APA

Awadallah, M. A., Khader, A. T., Al-Betar, M. A., & Bolaji, A. L. (2012). Harmony Search with Greedy Shuffle for Nurse Rostering. International Journal of Natural Computing Research (IJNCR), 3(2), 22-42. http://doi.org/10.4018/jncr.2012040102

Chicago

Awadallah, Mohammed A., et al. "Harmony Search with Greedy Shuffle for Nurse Rostering," International Journal of Natural Computing Research (IJNCR) 3, no.2: 22-42. http://doi.org/10.4018/jncr.2012040102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In this paper, a hybridization of Harmony Search Algorithm (HSA) with a greedy shuffle move is proposed for Nurse Rostering Problem (NRP). NRP is a combinatorial optimization problem that is tackled by assigning a set of nurses with different skills and contracts to different types of shifts, over a pre-determined scheduling period. HSA is a population-based method which mimics the improvisation process that has been successfully applied for a wide range of optimization problems. The performance of HSA is enhanced by hybridizing it with a greedy shuffle move. The proposed method is evaluated using a dataset defined in first International Nurse Rostering Competition (INRC2010). The hybrid HSA obtained the best results of the comparative methods in four datasets.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.