A time predefined variable depth search for nurse rostering
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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
INFORMS
2013
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/28283/ |
| _version_ | 1848793542830325760 |
|---|---|
| author | Burke, Edmund Curtois, Tim Qu, Rong Vanden Berghe, Greet |
| author_facet | Burke, Edmund Curtois, Tim Qu, Rong Vanden Berghe, Greet |
| author_sort | Burke, Edmund |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T19:01:58Z |
| format | Article |
| id | nottingham-28283 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:01:58Z |
| publishDate | 2013 |
| publisher | INFORMS |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-282832020-05-04T20:19:51Z https://eprints.nottingham.ac.uk/28283/ A time predefined variable depth search for nurse rostering Burke, Edmund Curtois, Tim Qu, Rong Vanden Berghe, Greet 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. INFORMS 2013 Article PeerReviewed Burke, Edmund, Curtois, Tim, 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 Timetabling personnel local search heuristics http://pubsonline.informs.org/doi/abs/10.1287/ijoc.1120.0510 doi:10.1287/ijoc.1120.0510 doi:10.1287/ijoc.1120.0510 |
| spellingShingle | Timetabling personnel local search heuristics Burke, Edmund Curtois, Tim Qu, Rong Vanden Berghe, Greet A time predefined variable depth search for nurse rostering |
| title | A time predefined variable depth search for nurse rostering |
| title_full | A time predefined variable depth search for nurse rostering |
| title_fullStr | A time predefined variable depth search for nurse rostering |
| title_full_unstemmed | A time predefined variable depth search for nurse rostering |
| title_short | A time predefined variable depth search for nurse rostering |
| title_sort | time predefined variable depth search for nurse rostering |
| topic | Timetabling personnel local search heuristics |
| url | https://eprints.nottingham.ac.uk/28283/ https://eprints.nottingham.ac.uk/28283/ https://eprints.nottingham.ac.uk/28283/ |