A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
type: Item
instance of: scholarly article
title: A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
zbMATH Open document ID: 1461.90194
author: Ioannis P. Solos
author: Ioannis X. Tassopoulos
author: Grigorios N. Beligiannis
published in: Algorithms
publication date: 2019-03-26T00:00:00Z
review text: Summary: In this contribution, a generic two-phase stochastic variable neighborhood approach is applied to nurse rostering problems. The proposed algorithm is used for creating feasible and efficient nurse rosters for many different nurse rostering cases. In order to demonstrate the efficiency and generic applicability of the proposed approach, experiments with real-world input data coming from many different nurse rostering cases have been conducted. The nurse rostering instances used have significant differences in nature, structure, philosophy and the type of hard and soft constraints. Computational results show that the proposed algorithm performs better than six different existing approaches applied to the same nurse rostering input instances using the same evaluation criteria. In addition, in all cases, it manages to reach the best-known fitness achieved in the literature, and in one case, it manages to beat the best-known fitness achieved till now.
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7042161
zbMATH Keywords: nurse rostering
zbMATH Keywords: hospital personnel scheduling
zbMATH Keywords: stochastic variable neighborhood
zbMATH Keywords: two-phase algorithm
zbMATH Keywords: mutation element
zbMATH Keywords: swap selective mutation
zbMATH Keywords: reduce Rosters
zbMATH Keywords: cost
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/a6020278
OpenAlex ID: W2014029878
cites work: Using tabu search with longer-term memory and relaxation to create examination timetables.
cites work: The state of the art of nurse rostering
cites work: Personnel scheduling: a literature review
cites work: An indirect genetic algorithm for a nurse-scheduling problem
cites work: An evolutionary approach for the nurse rerostering problem
cites work: Solving the multi-objective nurse scheduling problem with a weighted cost function
cites work: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
cites work: A greedy-based neighborhood search approach to a nurse rostering problem.
cites work: An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
cites work: Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
cites work: A variable neighborhood search for graph coloring.
cites work: A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
cites work: Hybrid variable neighbourhood approaches to university exam timetabling
cites work: Variable neighborhood decomposition search
cites work: Variable neighbourhood search: methods and applications
cites work: A shift sequence based approach for nurse scheduling and a new benchmark dataset
DOI: 10.3390/A6020278
description: scientific article; zbMATH DE number 7042161