A two-phase adaptive variable neighborhood approach for nurse rostering

Computers and Operations Research

Volumn 60, Issue , 2015, Pages 150-169

  Tassopoulos, Ioannis X ^a   Solos, Ioannis P ^a   Beligiannis, Grigorios N ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Hospital personnel scheduling; Nurse rostering; Two phase algorithm; Variable neighborhood

Indexed keywords

NURSING; OPTIMIZATION; SCHEDULING;

COMPUTATIONAL RESULTS; NURSE ROSTERING; PROBLEM INSTANCES; TWO PHASE; TWO PHASE ALGORITHM; VARIABLE NEIGHBORHOOD;

ALGORITHMS;

EID: 84925134772     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2015.02.009     Document Type: Article

References (33)

1. Awadallah MA, Khader AT, Al-Betar MA, Bolaji AL. Hybrid harmony search for nurse rostering problems. In: Proceedings of the 2013 IEEE symposium on computational intelligence in scheduling (SCIS); 2013. p. 60-7.
2. Messelis T, De Causmaecker P, Vanden Berghe G. Algorithm performance prediction for nurse rostering. In: Proceedings of the 6th multidisciplinary international scheduling conference: theory and applications (MISTA); 2013.
3. Haspeslagh S, De Causmaecker P, Stolevik M, Schaerf A. The first international nurse rostering competition 2010. In: Proceedings of the 8th international conference on the practice and theory of automated timetabling (PATAT); 2010.
4. J. Van den Bergh, J. Beliën, P. de Bruecker, E. Demeulemeester, and L. de Boeck Personnel scheduling: a literature review Eur J Oper Res 226 3 2013 367 385
5. R. Bai, E.K. Burke, G. Kendall, J. Li, and B. McCollum A hybrid evolutionary approach to the nurse rostering problem IEEE Trans Evolut Comput 14 4 2010 580 590
6. B. Maenhout, and M. Vanhoucke An evolutionary approach for the nurse rostering problem Comput Oper Res 38 10 2011 1400 1411
7. E. Ozcan Memetic algorithms for nurse rostering Lecture notes in computer science vol. 3733 2005 Springer Berlin Heidelberg 482 492
8. E.K. Burke, P. De Causmaecker, S. Petrovic, and G. Vanden Berghe Variable neighborhood search for nurse rostering problems Resende M.C.G., J. Pinho de Sousa, Metaheuristics: computer decision-making 2003 Kluwer Academic Publishers Norwell, MA, USA 153 172 chapter 7
9. E.K. Burke, T. Curtois, G. Post, R. Qu, and B. Veltman A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem Eur J Oper Res 188 2 2008 330 341
10. Z. Lü, and J.-K. Hao Adaptive neighborhood search for nurse rostering Eur J Oper Res 218 3 2012 865 876
11. I.P. Solos, I.X. Tassopoulos, and G.N. Beligiannis A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem Algorithms 6 2 2013 278 308
12. E.K. Burke, T. Curtois, R. Qu, and G. Vanden Berghe A scatter search methodology for the nurse rostering problem J Oper Res Soc 61 2010 1667 1679
13. B. Maenhout, and M. Vanhoucke New computational results for the nurse scheduling problem: a scatter search algorithm Lecture notes in computer science vol. 3906 2006 Springer Berlin, Heidelberg 159 170
14. Burke E, Soubeiga E. Scheduling nurses using a tabu-search hyperheuristic. In: Proceeding of the 1st multidisciplinary international scheduling conference (MISTA); 2003. p. 197-218.
15. Oughalime A, Ismail WR, Yeun LC. A tabu search approach to the nurse scheduling problem. In: Proceeding of the international symposium on information technology (ITSim); 2008. p. 1-7.
16. E.K. Burke, T. Curtois, L.F. van Draat, J.K. van Ommeren, and G. Post Progress control in iterated local search for nurse rostering J Oper Res Soc 62 2 2011 360 367
17. Kundu S, Mahato M, Mahanty B, Acharyya S. Comparative performance of simulated annealing and genetic algorithm in solving nurse scheduling problem. In: Proceeding of the International Multi Conference on Engineers and Computer Sciences (IMECS); 2008. p. 19-21.
18. W.J. Gutjahr, and M.S. Rauner An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria Comput Oper Res 34 3 2007 642 666
19. M. Gunther, and V. Nissen Particle swarm optimization and the agent-based algorithm for a problem of staff scheduling Lecture notes in computer science vol. 6025 2010 Springer Berlin, Heidelberg 451 461
20. Z. Lü, J.-K. Hao, and F. Glover Neighborhood analysis: a case study on curriculum-based course timetabling J Heuristics 17 2 2011 97 118
21. C. Valouxis, C. Gogos, G. Goulas, P. Alefragis, and E. Housos A systematic two phase approach for the nurse rostering problem Eur J Oper Res 219 2 2012 425 433
22. Burke EK, Curtois T. An ejection chain method and a branch and price algorithm applied to the instances of the first international nurse rostering competition. In: Proceedings of the 8th international conference on the practice and theory of automated timetabling (PATAT); 2010.
23. Nonobe K. INRC-2010: an approach using a general constraint optimization solver. In: Proceedings of the 8th international conference on the practice and theory of automated timetabling (PATAT); 2010.
24. Bilgin B, Demeester P, MIsIr M, Vancroonenburg W, Vanden Berghe G, Wauters T. A hyper-heuristic combined with a greedy shuffle approach to the nurse rostering competition. In: Proceedings of the 8th international conference on the practice and theory of automated timetabling (PATAT); 2010.
25. H.G. Santos, T.A.M. Toffolo, R.A.M. Gomes, and S. Ribas Integer programming techniques for the nurse rostering problem Ann Oper Res 2014 1 17 10.1007/s10479-014-1594-6
26. Instances - Nurse Rostering Competition: [last accessed 05.02.15].
27. Instances & Results - Nurse Rostering Competition: [last accessed 05.02.15].
28. Automated employee scheduling benchmark instances: >http://www.cs.nott.ac.uk/-tec/NRP/> [last accessed 05.02.15].
29. < http://www.deapt.upatras.gr/variable-neighborhood-nurse-rostering/variable-neighborhood-nurse-rostering.htm> [last accessed 05.02.15].
30. E.K. Burke, T. Curtois, R. Qu, and G. Vanden Berghe A time predefined variable depth search for nurse rostering INFORMS J Comput 25 3 2013 411 419
31. T. Osogami, and H. Imai Classification of various neighborhood operations for the nurse scheduling problem Technical report 135 2000 The Institute of Statistical Mathematics
32. P. De Causmaecker, and G. Vanden Berghe A categorisation of nurse rostering problems J Sched 14 1 2011 3 16
33. G. Nemhauser, and L.A. Wolsey Integer and combinatorial optimization 1988 John Wiley & Sons New York