A hybrid integer programming and variable neighborhood search algorithm to solve Nurse Rostering Problems

Rahimian, Erfan and Akartunali, Kerem and Levine, John (2017) A hybrid integer programming and variable neighborhood search algorithm to solve Nurse Rostering Problems. European Journal of Operational Research, 258 (2). 411–423. ISSN 0377-2217 (https://doi.org/10.1016/j.ejor.2016.09.030)

[thumbnail of Rahimian-etal-EJOR-2016-Hybrid-integer-programming-and-variable-neighborhood-search-algorithm]
Preview
 Text. Filename: Rahimian_etal_EJOR_2016_Hybrid_integer_programming_and_variable_neighborhood_search_algorithm.pdf
Accepted Author Manuscript
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo
Download (487kB)| Preview

Abstract

The Nurse Rostering Problem (NRP) is defined as assigning a number of nurses to different shifts during a specified planning period, considering some regulations and preferences. This is often very difficult to solve in practice particularly by applying a sole approach. In this paper, we propose a novel hybrid algorithm combining the strengths of Integer Programming (IP) and Variable Neighbourhood Search (VNS) algorithms to design a hybrid method for solving the NRP. After generating the initial solution using a greedy heuristic, the solution is further improved by employing a Variable Neighbourhood Descent algorithm. Then IP, deeply embedded in the VNS algorithm, is employed within a ruin-and-recreate framework to assist the search process. Finally, IP is called again to further refine the solution during the remaining time. We utilize the strength of IP not only to diversify the search process, but also to intensify the search efforts. To identify the quality of the current solution, we use a new generic scoring scheme to mark the low-penalty parts of the solution. Based on the computational tests with 24 instances recently introduced in the literature, we obtain better results with our proposed algorithm, where the hybrid algorithm outperforms two state-of-the-art algorithms and Gurobi in most of the instances. Furthermore, we introduce 11 randomly generated instances to further evaluate the efficiency of the hybrid algorithm, and we make these computationally challenging instances publicly available to other researchers for benchmarking purposes.

ORCID iDs

Rahimian, Erfan ORCID logoORCID: https://orcid.org/0000-0003-0532-0700, Akartunali, Kerem ORCID logoORCID: https://orcid.org/0000-0003-0169-3833 and Levine, John ORCID logoORCID: https://orcid.org/0000-0001-7016-2978;
CORE (COnnecting REpositories)