Adaptive neighborhood search for nurse rostering
2012
European Journal of Operational Research
3
218
865-876
Journal_Article
Personnel_Planning_and_Scheduling
Algorithms_Heuristics
Tactical||Operational_Offline
NA
NA
Article Link
L
This paper presents an adaptive neighborhood search method (ANS) for solving the nurse rostering problem proposed for the First International Nurse Rostering Competition (INRC-2010). ANS uses jointly two distinct neighborhood moves and adaptively switches among three intensification and diversification search strategies according to the search history. Computational results assessed on the three sets of 60 competition instances show that ANS improves the best known results for 12 instances while matching the best bounds for 39 other instances. An analysis of some key elements of ANS sheds light on the understanding of the behavior of the proposed algorithm.