Output details
11 - Computer Science and Informatics
University of Stirling
A Hybrid Model of Integer Programming and Variable Neighbourhood Search for Highly-Constrained Nurse Rostering Problems
<22> This paper presents a new hybrid decomposition approach that combines Integer Programming and Variable Neighbourhood Search to effectively solve the nurse rostering problem in a Dutch hospital. The approach could be applied to other resource-allocation problems defined by a large number of constraints. The research sheds light on the issue of integrating the two broad methodologies of exact algorithms and metaheuristics. It is attracting significant attention from practitioners and researchers in mathematical programming and heuristic design and is cited in a recent review on personnel scheduling (Van D Bergh et al. European Journal of Operational Research 226(3):367-385).