A Variable Neighbourhood Search for Nurse Scheduling with Balanced Preference Satisfaction

Ademir Aparecido Constantino, Everton Tozzo, Rodrigo Lankaites Pinheiro, Dario Landa-Silva, Wesley Romão

2015

Abstract

The nurse scheduling problem (NSP) is a combinatorial optimisation problem widely tackled in the literature. Recently, a new variant of this problem was proposed, called nurse scheduling problem with balanced preference satisfaction (NSPBPS). This paper further investigates this variant of the NSP as we propose a new algorithm to solve the problem and obtain a better balance of overall preference satisfaction. Initiall, the algorithm converts the problem to a bottleneck assignment problem and solves it to generate an initial feasible solution for the NSPBPS. Posteriorly, the algorithm applies the Variable Neighbourhood Search (VNS) metaheuristic using two sets of search neighbourhoods in order to improve the initial solution. We empirically assess the performance of the algorithm using the NSPLib benchmark instances and we compare our results to other results found in the literature. The proposed VNS algorithm exhibits good performance by achieving solutions that are fairer (in terms of preference satisfaction) for the majority of the scenarios.

References

  1. Bard, J. F. and Purnomo, H. W. (2005). A column generation-based approach to solve the preference scheduling problem for nurses with downgrading. Socio-Economic Planning Sciences, 39(3):193 - 213.
  2. Beddoe, G., Petrovic, S., and Li, J. (2009). A hybrid metaheuristic case-based reasoning system forÂa?nurseÂa?rostering. Journal of Scheduling, 12(2):99-119.
  3. Burke, E., De Causmaecker, P., Berghe, G., and Van Landeghem, H. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7(6):441-499.
  4. Burke, E. K., Curtois, T., Post, G., Qu, R., and Veltman, B. (2008). A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research, 188(2):330 - 341.
  5. Carpaneto, G. and Toth, P. (1981). Algorithm for the solution of the bottleneck assignment problem. Computing, 27(2):179-187.
  6. Cheang, B., Li, H., Lim, A., and Rodrigues, B. (2003). Nurse rostering problemsâA? S¸âA? S¸a bibliographic survey. European Journal of Operational Research, 151(3):447 - 460.
  7. Cheng, M., Ozaku, H., Kuwahara, N., Kogure, K., and Ota, J. (2007). Simulated annealing algorithm for daily nursing care scheduling problem. In Automation Science and Engineering, 2007. CASE 2007. IEEE International Conference on, pages 507-512.
  8. Constantino, A., Landa-silva, D., de Melo, E., and Romão, W. (2011). A heuristic algorithm for nurse scheduling with balanced preference satisfaction. In Computational Intelligence in Scheduling (SCIS), 2011 IEEE Symposium on, pages 39-45.
  9. Constantino, A., Landa-Silva, D., Melo, E. L., Mendonça, C. F. X., Rizzato, D. B., and Romão, W. (2013). A heuristic algorithm based on multi-assignment procedures for nurse scheduling. Annals of Operations Research, pages 1-19.
  10. Goodman, M., Dowsland, K., and Thompson, J. (2009). A grasp-knapsack hybrid for a nurse-scheduling problem. Journal of Heuristics, 15(4):351-379.
  11. Maenhout, B. and Vanhoucke, M. (2005). Nsplib - a nurse scheduling problem library: a tool to evaluate (meta)heuristic procedures. In O.R. in health, pages 151- 165. Elsevier.
  12. Maenhout, B. and Vanhoucke, M. (2006). New computational results for the nurse scheduling problem: A scatter search algorithm. In Gottlieb, J. and Raidl, G., editors, Evolutionary Computation in Combinatorial Optimization, volume 3906 of Lecture Notes in Computer Science, pages 159-170. Springer Berlin Heidelberg.
  13. Maenhout, B. and Vanhoucke, M. (2007). An electromagnetic meta-heuristic for the nurse scheduling problem. Journal of Heuristics, 13(4):359-385.
  14. Maenhout, B. and Vanhoucke, M. (2008). Comparison and hybridization of crossover operators for the nurse scheduling problem. Annals of Operations Research, 159(1):333-353.
  15. Mladenovic, N. and Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11):1097 - 1100.
  16. Ohki, M., Uneme, S., and Kawano, H. (2008). Parallel processing of cooperative genetic algorithm for nurse scheduling. In Intelligent Systems, 2008. IS 7808. 4th International IEEE Conference, volume 2, pages 10- 36-10-41.
  17. Osogami, T. and Imai, H. (2000). Classification of various neighborhood operations for the nurse scheduling problem. In Goos, G., Hartmanis, J., Leeuwen, J., Lee, D., and Teng, S.-H., editors, Algorithms and Computation, volume 1969 of Lecture Notes in Computer Science, pages 72-83. Springer Berlin Heidelberg.
  18. Oughalime, A., Ismail, W., and Yeun, L. C. (2008). A tabu search approach to the nurse scheduling problem. In Information Technology, 2008. ITSim 2008. International Symposium on, volume 1, pages 1-7.
  19. Petrovic, S. and Vanden Berghe, G. (2008). Comparison of algorithms for nurse rostering problems. In Proceedings of The 7th International Conference on the Practice and Theory of Automated Timetabling, pages 1-18.
  20. Tsai, C.-C. and Li, S. H. (2009). A two-stage modeling with genetic algorithms for the nurse scheduling problem. Expert Systems with Applications, 36(5):9506 - 9512.
  21. Yilmaz, E. (2012). A mathematical programming model for scheduling of nurses' labor shifts. Journal of Medical Systems, 36(2):491-496.
Download


Paper Citation


in Harvard Style

Aparecido Constantino A., Tozzo E., Lankaites Pinheiro R., Landa-Silva D. and Romão W. (2015). A Variable Neighbourhood Search for Nurse Scheduling with Balanced Preference Satisfaction . In Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-758-096-3, pages 462-470. DOI: 10.5220/0005364404620470


in Bibtex Style

@conference{iceis15,
author={Ademir Aparecido Constantino and Everton Tozzo and Rodrigo Lankaites Pinheiro and Dario Landa-Silva and Wesley Romão},
title={A Variable Neighbourhood Search for Nurse Scheduling with Balanced Preference Satisfaction},
booktitle={Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2015},
pages={462-470},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005364404620470},
isbn={978-989-758-096-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - A Variable Neighbourhood Search for Nurse Scheduling with Balanced Preference Satisfaction
SN - 978-989-758-096-3
AU - Aparecido Constantino A.
AU - Tozzo E.
AU - Lankaites Pinheiro R.
AU - Landa-Silva D.
AU - Romão W.
PY - 2015
SP - 462
EP - 470
DO - 10.5220/0005364404620470