Variable Neighborhood Search for Nurse Rostering Problems

2003 ◽  
pp. 153-172 ◽  
Author(s):  
Edmund Burke ◽  
Patrick De Causmaecker ◽  
Sanja Petrovic ◽  
Greet Vanden Berghe
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Nurse Rostering

A variable neighborhood search based matheuristic for nurse rostering problems

2012 ◽  
Vol 218 (1) ◽  
pp. 185-199 ◽  
Author(s):  
Federico Della Croce ◽  
Fabio Salassa
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Nurse Rostering

scholarly journals A new two-stage variable neighborhood search algorithm for the nurse rostering problem

2021 ◽  
Author(s):  
Mohammed Abdelghany ◽  
Zakaria Yahia ◽  
Amr B. Eltawil
Keyword(s):  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Soft Constraints ◽  
Nurse Rostering ◽  
Two Stage ◽  
Nurse Rostering Problem ◽  
Solution Methods ◽  
Np Hard Problem ◽  
Neighborhood Search Algorithm

The nurse rostering problem refers to the assignment of nurses to daily shifts according to the required demand of each shift and day, with consideration for the operational requirements and nurses’ preferences. This problem is known to be an NP-hard problem, difficult to be solved using the known exact solution methods especially for large size instances. Mostly, this problem is modeled with soft and hard constraint, and the objective is set to minimize the violations for the soft constraints. In this paper, a new two-stage variable neighborhood search algorithm is proposed for solving the nurse rostering problem. The first stage aims at minimizing the violations of the soft constraints with the higher penalty weights in the objective function. While the second stage considers minimizing the total solution penalty taking into account all the soft constraint. The proposed algorithm was tested using 24 benchmark instances. The test results revealed that the proposed algorithm is able to compete the results of a recent heuristic approach from literature for most of the tested instances.

Neighborhood decomposition-driven variable neighborhood search for capacitated clustering

2021 ◽  
pp. 105362
Author(s):  
Xiangjing Lai ◽  
Jin-Kao Hao ◽  
Zhang-Hua Fu ◽  
Dong Yue
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search
Sign in / Sign up

Export Citation Format

Share Document