Local search neighbourhoods for dealing with a novel nurse rostering model

A novel nurse rostering model is developed to represent real world problem instances more accurately. The proposed model is generic in the sense that it allows modelling of essentially different problem instances. Novel local search neighbourhoods are implemented to take advantage of the problem properties represented by the model. These neighbourhoods are used in a variable neighbourhood search and in an adaptive large neighbourhood search algorithm. The performance of the solution method is evaluated empirically on real world data. The proposed model is open to further extensions for covering personnel planning problems in different sectors and countries.

[1]  Edmund K. Burke,et al.  A shift sequence based approach for nurse scheduling and a new benchmark dataset , 2010, J. Heuristics.

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

[3]  Ender Özcan,et al.  Memes, Self-generation and Nurse Rostering , 2006, PATAT.

[4]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[5]  Jonathan F. Bard,et al.  Cyclic preference scheduling of nurses using a Lagrangian-based heuristic , 2007, J. Sched..

[6]  Celia A. Glass,et al.  The nurse rostering problem: A critical appraisal of the problem structure , 2010, Eur. J. Oper. Res..

[7]  Luca Di Gaspero,et al.  Multi-neighbourhood Local Search with Application to Course Timetabling , 2002, PATAT.

[8]  Uwe Aickelin,et al.  An estimation of distribution algorithm for nurse scheduling , 2007, Ann. Oper. Res..

[9]  Erik Demeulemeester,et al.  On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem , 2007, Ann. Oper. Res..

[10]  Patrick De Causmaecker,et al.  Relaxation of Coverage Constraints in Hospital Personnel Rostering , 2002, PATAT.

[11]  Edmund K. Burke,et al.  A Decomposition, Construction and Post-processing Approach for a Specific Nurse Rostering Problem , 2005 .

[12]  P. Hansen,et al.  Variable neighborhood search for the p-median , 1997 .

[13]  Edmund K. Burke,et al.  The practice and theory of automated timetabling , 2014, Ann. Oper. Res..

[14]  Sanja Petrovic,et al.  Comparison of Algorithms for Nurse Rostering Problems , 2008 .

[15]  Luca Di Gaspero,et al.  Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals , 2006, PATAT.

[16]  E.K. Burke,et al.  Fitness evaluation for nurse scheduling problems , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[17]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[18]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[19]  Nottingham Ng,et al.  A Hybrid Heuristic Ordering and Variable Neighbourhood Search for the Nurse Rostering Problem , 2005 .

[20]  Gary Yat Chung Wong,et al.  Constraint-based rostering using meta-level reasoning and probability-based ordering , 2004, Eng. Appl. Artif. Intell..

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

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

[23]  Roberto Tadei,et al.  A greedy-based neighborhood search approach to a nurse rostering problem , 2004, Eur. J. Oper. Res..

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

[25]  Gilles Pesant,et al.  HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care , 2003, CP.

[26]  Mario Vanhoucke,et al.  Comparison and hybridization of crossover operators for the nurse scheduling problem , 2008, Ann. Oper. Res..

[27]  Edmund K. Burke,et al.  Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals , 2004, Handbook of Scheduling.

[28]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[29]  Tapan Kumar Pal,et al.  On comparing interval numbers , 2000, Eur. J. Oper. Res..