View in EDS

Progress control in iterated local search for nurse rostering.

Saved in:
Bibliographic Details
Title: Progress control in iterated local search for nurse rostering.
Authors: Burke, E. K.1, Curtois, T.1, van Draat, L. F.2, van Ommeren, J.-K.3, Post, G.2,3 g.f.post@math.utwente.nl
Source: Journal of the Operational Research Society. Feb2011, Vol. 62 Issue 2, p360-367. 8p. 5 Charts.
Subjects: Electronic information resource searching, Nurses, Operations research, Heuristic algorithms, Database searching
Abstract: This paper describes an approach in which a local search technique is alternated with a process which 'jumps' to another point in the search space. After each 'jump' a (time-intensive) local search is used to obtain a new local optimum. The focus of the paper is in monitoring the progress of this technique on a set of real world nurse rostering problems. We propose a model for estimating the quality of this new local optimum. We can then decide whether to end the local search based on the predicted quality. The fact that we avoid searching these bad neighbourhoods enables us to reach better solutions in the same amount of time. We evaluate the approach on five highly constrained problems in nurse rostering. These problems represent complex and challenging real world rostering situations and the approach described here has been developed during a commercial implementation project by ORTEC by. [ABSTRACT FROM AUTHOR]
Copyright of Journal of the Operational Research Society is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:This paper describes an approach in which a local search technique is alternated with a process which 'jumps' to another point in the search space. After each 'jump' a (time-intensive) local search is used to obtain a new local optimum. The focus of the paper is in monitoring the progress of this technique on a set of real world nurse rostering problems. We propose a model for estimating the quality of this new local optimum. We can then decide whether to end the local search based on the predicted quality. The fact that we avoid searching these bad neighbourhoods enables us to reach better solutions in the same amount of time. We evaluate the approach on five highly constrained problems in nurse rostering. These problems represent complex and challenging real world rostering situations and the approach described here has been developed during a commercial implementation project by ORTEC by. [ABSTRACT FROM AUTHOR]
ISSN:01605682
DOI:10.1057/jors.2010.86