A hybrid artificial bee colony for a nurse rostering problem

Graphical abstractDisplay Omitted HighlightsProposed a hybrid artificial bee colony (HABC) algorithm for a nurse rostering problem (NRP).Compared the HABC results with other eleven comparative methods using INRC2010 dataset.Showed that HABC algorithm performs well.This research showed that a well-designed hybrid technique is a competitive alternative for solving NRP. The nurse rostering problem (NRP) is a combinatorial optimization problem tackled by assigning a set of shifts to a set of nurses, each has specific skills and work contract, to a predefined rostering period according to a set constraints. The metaheuristics are the most successful methods for tackling this problem. This paper proposes a metaheuristic technique called a hybrid artificial bee colony (HABC) for NRP. In HABC, the process of the employed bee operator is replaced with the hill climbing optimizer (HCO) to empower its exploitation capability and the usage of HCO is controlled by hill climbing rate (HCR) parameter. The performance of the proposed HABC is evaluated using the standard dataset published in the first international nurse rostering competition 2010 (INRC2010). This dataset consists of 69 instances which reflect this problem in many real-world cases that are varied in size and complexity. The experimental results of studying the effect of HCO using different value of HCR show that the HCO has a great impact on the performance of HABC. In addition, a comparative evaluation of HABC is carried out against other eleven methods that worked on INRC2010 dataset. The comparative results show that the proposed algorithm achieved two new best results for two problem instances, 35 best published results out of 69 instances as achieved by other comparative methods, and comparable results in the remaining instances of INRC2010 dataset.

[1]  Mario Vanhoucke,et al.  An electromagnetic meta-heuristic for the nurse scheduling problem , 2007, J. Heuristics.

[2]  Mohammed Azmi Al-Betar,et al.  Harmony Search with Greedy Shuffle for Nurse Rostering , 2012, Int. J. Nat. Comput. Res..

[3]  Túlio A. M. Toffolo,et al.  Integer programming techniques for the nurse rostering problem , 2014, Annals of Operations Research.

[4]  Harvey H. Millar,et al.  Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming , 1998 .

[5]  Dervis Karaboga,et al.  A comprehensive survey: artificial bee colony (ABC) algorithm and applications , 2012, Artificial Intelligence Review.

[6]  Erik Demeulemeester,et al.  Personnel scheduling: A literature review , 2013, Eur. J. Oper. Res..

[7]  Edmund K. Burke,et al.  New approaches to nurse rostering benchmark instances , 2014, Eur. J. Oper. Res..

[8]  George Goulas,et al.  A systematic two phase approach for the nurse rostering problem , 2012, Eur. J. Oper. Res..

[9]  Mohammed Azmi Al-Betar,et al.  A Hybrid Nature-Inspired Artificial Bee Colony Algorithm for Uncapacitated Examination Timetabling Problems , 2015, J. Intell. Syst..

[10]  Jin-Kao Hao,et al.  Adaptive neighborhood search for nurse rostering , 2012, Eur. J. Oper. Res..

[11]  Jin-Kao Hao,et al.  Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..

[12]  Hendrik Van Landeghem,et al.  The State of the Art of Nurse Rostering , 2004, J. Sched..

[13]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[14]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[15]  Ender Özcan,et al.  Memetic Algorithms for Nurse Rostering , 2005, ISCIS.

[16]  Uwe Aickelin,et al.  An Indirect Genetic Algorithm for a Nurse Scheduling Problem , 2004, Comput. Oper. Res..

[17]  Edmund K. Burke,et al.  A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem , 2004, Eur. J. Oper. Res..

[18]  Marjan Mernik,et al.  A parameter control method of evolutionary algorithms using exploration and exploitation measures with a practical application for fitting Sovova's mass transfer model , 2013, Appl. Soft Comput..

[19]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[20]  Chang-Chun Tsai,et al.  A two-stage modeling with genetic algorithms for the nurse scheduling problem , 2009, Expert Syst. Appl..

[21]  Mohammed Azmi Al-Betar,et al.  University course timetabling using hybridized artificial bee colony with hill climbing optimizer , 2014, J. Comput. Sci..

[22]  Quan-Ke Pan,et al.  Flexible job shop scheduling problems by a hybrid artificial bee colony algorithm , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[23]  Walter J. Gutjahr,et al.  An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria , 2007, Comput. Oper. Res..

[24]  Marjan Mernik,et al.  Exploration and exploitation in evolutionary algorithms: A survey , 2013, CSUR.

[25]  Alok Singh,et al.  An Artificial Bee Colony Algorithm for the Quadratic Knapsack Problem , 2009, ICONIP.

[26]  Patrick De Causmaecker,et al.  The first international nurse rostering competition 2010 , 2010, Ann. Oper. Res..

[27]  E. Burke,et al.  Variable neighborhood search for nurse rostering problems , 2004 .

[28]  Christian Blum,et al.  Hybrid metaheuristics in combinatorial optimization: A survey , 2011, Appl. Soft Comput..

[29]  Mohammed Azmi Al-Betar,et al.  Hyper-heuristic approach for solving nurse rostering problem , 2014, 2014 IEEE Symposium on Computational Intelligence in Ensemble Learning (CIEL).

[30]  Andrew Lim,et al.  Nurse rostering problems - a bibliographic survey , 2003, Eur. J. Oper. Res..

[31]  Dervis Karaboga,et al.  On clarifying misconceptions when comparing variants of the Artificial Bee Colony Algorithm by offering a new implementation , 2015, Inf. Sci..

[32]  Kathryn A. Dowsland,et al.  Nurse scheduling with tabu search and strategic oscillation , 1998, Eur. J. Oper. Res..

[33]  X. Cai,et al.  A genetic algorithm for scheduling staff of mixed skills under multi-criteria , 2000, Eur. J. Oper. Res..

[34]  Peter Demeester,et al.  One hyper-heuristic approach to two timetabling problems in health care , 2012, J. Heuristics.

[35]  Peter I. Cowling,et al.  A Memetic Approach to the Nurse Rostering Problem , 2001, Applied Intelligence.

[36]  Patrick De Causmaecker,et al.  Local search neighbourhoods for dealing with a novel nurse rostering model , 2012, Ann. Oper. Res..

[37]  Graham Kendall,et al.  A Hybrid Evolutionary Approach to the Nurse Rostering Problem , 2010, IEEE Transactions on Evolutionary Computation.

[38]  Mohammed Azmi Al-Betar,et al.  Global best Harmony Search with a new pitch adjustment designed for Nurse Rostering , 2013, J. King Saud Univ. Comput. Inf. Sci..

[39]  Koji Nonobe.  INRC2010: An Approach Using a General Constraint Optimization Solver , 2010 .

[40]  Kenneth Sörensen,et al.  Metaheuristics - the metaphor exposed , 2015, Int. Trans. Oper. Res..

[41]  Toshihide Ibaraki,et al.  A tabu search approach to the constraint satisfaction problem as a general problem solver , 1998, Eur. J. Oper. Res..

[42]  Marjan Mernik,et al.  Replication and comparison of computational experiments in applied evolutionary computing: Common pitfalls and guidelines to avoid them , 2014, Appl. Soft Comput..

[43]  Mohammed Azmi Al-Betar,et al.  Hybrid Harmony Search for Nurse Rostering Problems , 2013, 2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched).

[44]  Larry W. Jacobs,et al.  Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations , 1995 .

[45]  Marjan Mernik,et al.  Is a comparison of results meaningful from the inexact replications of computational experiments? , 2016, Soft Comput..

[46]  Edmund K. Burke,et al.  A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem , 1998, SEAL.

[47]  Edmund K. Burke,et al.  A scatter search methodology for the nurse rostering problem , 2010, J. Oper. Res. Soc..