Article ID: | iaor20122458 |
Volume: | 63 |
Issue: | 4 |
Start Page Number: | 489 |
End Page Number: | 496 |
Publication Date: | Apr 2012 |
Journal: | Journal of the Operational Research Society |
Authors: | Edleston O S S T, Bartlett L M |
Keywords: | scheduling, combinatorial optimization, heuristics: tabu search |
This paper presents an application of the tabu search algorithm to a staff rostering problem relevant to Leicestershire Police. The aim is to address the issue of structuring staff rosters to enable effective use of staff to meet the demand on the Police to reduce and deal with crime‐related incidents. This problem is defined through the compilation of a time‐varying level of required staff and an associated staff roster. The objective is an optimised work set‐up, maximising staff resources and the meeting of demand. Optimisation of staff levels to demand is sought through use of a series of tabu search algorithms, making use of two diversification techniques and an intensification technique individually and in compilation. The tabu search is shown to be a well‐suited optimisation approach to the type of problem defined, with individual conclusions drawn for each of the technique combinations used.