Hyper-heuristic approach for solving nurse rostering problem

Author

Anwar, Khairul ; Awadallah, Mohammed A. ; Khader, Ahamad Tajudin ; Al-betar, Mohammed Azmi

Author_Institution

Sch. of Comput. Sci., Univ. Sains Malaysia (USM), Minden, Malaysia

fYear

2014

fDate

9-12 Dec. 2014

Firstpage

1

Lastpage

6

Abstract

Hyper-heuristic (HH) is a higher level heuristic to choose from a set of heuristics applicable for the problem on hand. In this paper, a Harmony Search-based Hyper-heuristic (HSHH) approach is tested in solving nurse rostering problems (NRP). NRP is a complex scheduling problem of assigning given shifts to a given nurses. We test the proposed method by using the First International Nurse Rostering Competition 2010 (INRC2010) dataset. Experimentally, the HSHH approach achieved comparable results with the comparative methods in the literature.

Keywords

patient care; scheduling; search problems; First International Nurse Rostering Competition 2010; HSHH approach; INRC2010 dataset; NRP; complex scheduling problem; harmony search-based hyper-heuristic approach; higher level heuristic; nurse rostering problem; shift assignment; Contracts; Educational institutions; Optimization; Personnel; Scheduling; Search problems; Vectors; Nurse Rostering Problems; Harmony SearchALgorithm; Hyper-heuristic methods;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence in Ensemble Learning (CIEL), 2014 IEEE Symposium on

Conference_Location

Orlando, FL

Type

conf

DOI

10.1109/CIEL.2014.7015743

Filename

7015743