A time predefined variable depth search for nurse rostering

Burke, Edmund and Curtois, Tim and Qu, Rong and Vanden Berghe, Greet (2013) A time predefined variable depth search for nurse rostering. INFORMS Journal on Computing, 25 (3). pp. 411-419. ISSN 1091-9856

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (320kB) | Preview

Abstract

This paper presents a variable depth search for the nurse rostering problem. The algorithm works by chaining together single neighbourhood swaps into more effective compound moves. It achieves this by using heuristics to decide whether to continue extending a chain and which candidates to examine as the next potential link in the chain. Because 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.

Item Type: Article
Keywords: Timetabling, personnel, local search, heuristics
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1287/ijoc.1120.0510
Depositing User: Qu, Rong
Date Deposited: 15 Mar 2015 22:53
Last Modified: 16 Sep 2016 18:10
URI: http://eprints.nottingham.ac.uk/id/eprint/28283

Actions (Archive Staff Only)

Edit View Edit View