Hybrid Harmony Search for Nurse Rostering Problems

Author(s):  
Mohammed A. Awadallah ◽  
Ahamad Tajudin Khader ◽  
Mohammed Azmi Al-Betar ◽  
Asaju La'aro Bolaji
2013 ◽  
Vol 13 (6) ◽  
pp. 846-853 ◽  
Author(s):  
Masri Ayob ◽  
Mohammed Hadwan ◽  
Mohd. Zakree Ahmad Nazr ◽  
Zulkifli Ahmad

2013 ◽  
Vol 233 ◽  
pp. 126-140 ◽  
Author(s):  
Mohammed Hadwan ◽  
Masri Ayob ◽  
Nasser R. Sabar ◽  
Roug Qu

Author(s):  
Mohammed A. Awadallah ◽  
Ahamad Tajudin Khader ◽  
Mohammed Azmi Al-Betar ◽  
Asaju La’aro Bolaji

Author(s):  
Mohammed A. Awadallah ◽  
Ahamad Tajudin Khader ◽  
Mohammed Azmi Al-Betar ◽  
Asaju La’aro Bolaji

2012 ◽  
Vol 3 (2) ◽  
pp. 22-42 ◽  
Author(s):  
Mohammed A. Awadallah ◽  
Ahamad Tajudin Khader ◽  
Mohammed Azmi Al-Betar ◽  
Asaju La’aro Bolaji

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.


Sign in / Sign up

Export Citation Format

Share Document