Harmony Search with Greedy Shuffle for Nurse Rostering

Mohammed A. Awadallah, Ahamad Tajudin Khader, Mohammed Azmi Al-Betar and Asaju La’aro Bolaji
Additional contact information
Mohammed A. Awadallah: Universiti Sains Malaysia, Malaysia
Ahamad Tajudin Khader: Universiti Sains Malaysia, Malaysia
Mohammed Azmi Al-Betar: Universiti Sains Malaysia, Malaysia, & Jadara University, Jordan
Asaju La’aro Bolaji: Universiti Sains Malaysia, Malaysia

International Journal of Natural Computing Research (IJNCR), 2012, vol. 3, issue 2, 22-42

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.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jncr.2012040102 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jncr00:v:3:y:2012:i:2:p:22-42

Access Statistics for this article

International Journal of Natural Computing Research (IJNCR) is currently edited by Xuewen Xia

More articles in International Journal of Natural Computing Research (IJNCR) from IGI Global
Bibliographic data for series maintained by Journal Editor ().