Title: A time predefined variable depth search for nurse rostering
Authors: Burke, Edmund K. ×
Curtois, Tim
Qu, Rong
Vanden Berghe, Greet #
Issue Date: 2013
Publisher: INFORMS
Series Title: INFORMS Journal on Computing vol:25 issue:3 pages:411-419
Abstract: A variety of neighbourhood operators have been used in local search and metaheuristic approaches to solving nurse rostering problems. We test and analyse the efficiency of these neighbourhoods on benchmark problems taken from real world scenarios. A variable depth search is then developed based on the results of this investigation. The algorithm heuristically chains together moves and swaps which define the more effective search neighbourhoods. A number of heuristics for creating these chains were developed and we present experiments conducted to identify the best ones. As end users vary in how long they are willing to wait for solutions, a particular goal of this research was to create an algorithm that accepts a user specified computational time limit and uses it effectively. When compared against previously published approaches the results show that the algorithm is very competitive.
ISSN: 1091-9856
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Computer Science Technology TC, Technology Campuses Ghent and Aalst
Technologiecluster Computerwetenschappen
Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
INFORMSJOC.pdfarticle Published 370KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science