IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v63y2012i4p489-496.html
   My bibliography  Save this article

A tabu search algorithm applied to the staffing roster problem of Leicestershire police force

Author

Listed:
  • O S S T Edleston

    (Loughborough University, Loughborough, UK)

  • L M Bartlett

    (Loughborough University, Loughborough, UK)

Abstract

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.

Suggested Citation

  • O S S T Edleston & L M Bartlett, 2012. "A tabu search algorithm applied to the staffing roster problem of Leicestershire police force," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(4), pages 489-496, April.
    • Handle: RePEc:pal:jorsoc:v:63:y:2012:i:4:p:489-496
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v63/n4/pdf/jors201144a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v63/n4/full/jors201144a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:63:y:2012:i:4:p:489-496. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.