A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
2010
European Journal of Operational Research
2
203
484-493
Journal_Article
Personnel_Planning_and_Scheduling||Equitable_Resource_Allocation
Mathematical_programming_(Mixed)_Integer||Algorithms_Exact||Algorithms_Heuristics
Tactical||Operational_Offline
No
No
Article Link
Burke, E. K. L., Jingpeng; Qu, Rong. (2010). A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems. [Journal Article]. European Journal of Operational Research, 203(2), 484-493.
This paper presents a hybrid multi-objective model that combines integer programming (IP) and variable neighbourhood search (VNS) to deal with highly-constrained nurse rostering problems in modern hospital environments. An IP is first used to solve the subproblem which includes the full set of hard constraints and a subset of soft constrains. A basic VNS then follows as a postprocessing procedure to further improve the IP's resulting solutions. The satisfaction of the excluded constraints from the preceding IP model is the major focus of the VNS. Very promising results are reported compared with a commercial genetic algorithm and a hybrid VNS approach on real instances arising in a Dutch hospital. The comparison results demonstrate that our hybrid approach combines the advantages of both the IP and the VNS to beat other approaches in solving this type of problems. We also believe that the proposed methodology can be applied to other resource allocation problems with a large number of constraints.