A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
Open Access
- 1 January 2021
- journal article
- research article
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (4) , 2051-2072
Abstract
Nurse Rostering is the activity of assigning nurses to daily shifts in order to satisfy the cover requirements, taking into account the operational requirements and nurses' preferences. The problem is usually modeled as sets of hard and soft constraints with an objective function to minimize violations of soft constraints. The nurse rostering problem is known to be NP-hard. Many metaheuristics were used to tackle this problem. One of the frequently used heuristics is the Variable Neighbourhood Search (VNS). The VNS is usually used as a standalone method or in integration with another exact or heuristic method. In this paper, a new hybrid VNS and Dynamic Programming based heuristic approach is proposed to handle the nurse rostering problem. In the proposed approach, two perturbation mechanisms are adopted simultaneously. The proposed approach is tested on two different benchmark data sets. A comparison with state-of-the-art methods from literature revealed the competitive performance of the proposed approach.Keywords
This publication has 33 references indexed in Scilit:
- A Generic Two-Phase Stochastic Variable Neighborhood Approach for Effectively Solving the Nurse Rostering ProblemAlgorithms, 2013
- A variable neighborhood search based matheuristic for nurse rostering problemsAnnals of Operations Research, 2012
- Adaptive neighborhood search for nurse rosteringEuropean Journal of Operational Research, 2012
- The first international nurse rostering competition 2010Annals of Operations Research, 2012
- A bounded dynamic programming approach to schedule operations in a cross docking platformComputers & Industrial Engineering, 2011
- Progress control in iterated local search for nurse rosteringJournal of the Operational Research Society, 2011
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problemsEuropean Journal of Operational Research, 2010
- A dynamic programming based heuristic for the assembly line balancing problemEuropean Journal of Operational Research, 2009
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problemEuropean Journal of Operational Research, 2008
- A greedy-based neighborhood search approach to a nurse rostering problemEuropean Journal of Operational Research, 2004