Abstract
The article presents a Variable Neighborhood Search approach for personnel rostering problems, with a particular computer implementation (and results) for the data sets of the very recent First International Nurse Rostering Competition 2010. In this context, our work is motivated by two objectives: (i) The very fast computation of qualitatively good solutions, and (ii) the subsequent provision of decision aid by means of computational intelligence techniques. Starting from initially constructed solutions, we are able to demonstrate a considerable improvement of the quality of the solutions by means of the proposed metaheuristic. Moreover, and due to the rather problem-independent character of the approach, problem formulations with varying characteristics are equally supported by our solution approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Edmund K. Burke and Timothy Curtois. An ejection chain method and a branch and price algorithm applied to the instances of the first international nurse rostering competition, 2010. In Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling PATAT 2010, Belfast, Northern Ireland, August 2010. Queen’s University Belfast.
Edmund K. Burke, Timothy Curtois, Gerhard Post, Rong Qu, and Bart Veltmann. A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research, 188: 330–341, 2008.
De Causmaecker. Website of the first international nurse rostering competition. http://www.kuleuven-kortrijk.be/nrpcompetition, 2010.
A. T. Ernst, H. Jiang, M. Krishnamoorthy, and D. Sier. Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research, 153(1): 3–27, 2004.
Pierre Hansen and Nenad Mladenović. Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130: 449–467, 2001.
Panta Lučic and Dušan Teodorovic. Simulated annealing for the multi-objective aircrew rostering problem. Transportation Research Part A: Policy and Practice, 33(1): 19–45, 1999.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geiger, M.J. (2011). Personnel Rostering by Means of Variable Neighborhood Search. In: Hu, B., Morasch, K., Pickl, S., Siegle, M. (eds) Operations Research Proceedings 2010. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20009-0_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-20009-0_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20008-3
Online ISBN: 978-3-642-20009-0
eBook Packages: Business and EconomicsBusiness and Management (R0)