The Second International Nurse Rostering Competition
- 343 Downloads
This paper reports on the Second International Nurse Rostering Competition (INRC-II). Its contributions are (1) a new problem formulation which, differently from INRC-I, is a multi-stage procedure, (2) a competition environment that, as in INRC-I, will continue to serve as a growing testbed for search approaches to the INRC-II problem, and (3) final results of the competition. We discuss also the competition environment, which is an infrastructure including problem and instance definitions, testbeds, validation/simulation tools and rules. The hardness of the competition instances has been evaluated through the behaviour of our own solvers, and confirmed by the solvers of the participants. Finally, we discuss general issues about both nurse rostering problems and optimisation competitions in general.
KeywordsNurse rostering Optimisation competition Multi-stage optimisation
- Ceschia, S., Dang, N. T. T., De Causmaecker, P., Haspeslagh, S., & Schaerf, A. (2015). Second international nurse rostering competition (INRC-II), problem description and rules. CoRR. arXiv:1501.04177.
- CPLEX. (2012). CPLEX optimizer. v. 12.5. http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/. Accessed 13 Mar 2018
- Geiger, M. J. (2011). Personnel rostering by means of variable neighborhood search. In B. Hu, K. Morasch, S. Pickl, M. Siegle (Eds.), Operations research proceedings 2010 (pp. 219–224). Berlin, Heidelberg: Springer.Google Scholar
- Jin, H., Post, G., & van der Veen, E. (2016). ORTEC’s contribution to the second international nurse rostering competition. In Proceedings of the 11th international conference on the practice and theory of automated timetabling (PATAT-2016), pp. 599–501.Google Scholar
- Kheiri, A., Özcan, E., & Lewis, R., Thompson, J. (2016). A sequence-based selection hyper-heuristic: Case study in multi-stage nurse rostering problem. In Proceedings of the 11th international conference on the practice and theory of automated timetabling (PATAT-2016), pp. 503–505.Google Scholar
- Legrain, A., Omer, J., & Rosat, S. (2017). A rotation-based branch-and-price approach for the nurse scheduling problem. Working paper. https://hal.archives-ouvertes.fr/hal-01545421. Accessed 13 Mar 2018
- Römer, M., & Mellouli, T. (2016a). A direct MILP approach based on state-expanded network flows and anticipation for multi-stage nurse rostering under uncertainty. In Proceedings of the 11th international conference on the practice and theory of automated timetabling (PATAT-2016), pp. 549–551.Google Scholar
- Römer, M., & Mellouli, T. (2016b). Future demand uncertainty in personnel scheduling: Investigating deterministic lookahead policies using optimization and simulation. In Proceedings of the 30th European conference on modelling and simulation (ECMS 2016), pp. 502–507.Google Scholar
- Salassa, F., & Vanden Berghe, G. (2012). A stepping horizon view on nurse rostering. In Proceedings of the 9th international conference on the practice and theory of automated timetabling (PATAT-2012), pp. 161–173.Google Scholar
- Schaerf, A., & Di Gaspero, L. (2007). Measurability and reproducibility in timetabling research: Discussion and proposals. In E. Burke & H. Rudová (Eds.), Proceedings of the 6th international conference on the practice and theory of automated timetabling (PATAT-2006), selected papers, Volumne 3867 of Lecture Notes in Computer Science (pp. 40–49). Berlin: Springer.Google Scholar
- Zhouxing, S., Zhuo, W., & Zhipeng, L. (2016). Weighted tabu search for multi-stage nurse rostering problem. SCIENTIA SINICA Informationis, 46(7), 834–854.Google Scholar