Skip to main content

Research Repository

Advanced Search

Workforce scheduling and routing problems: literature survey and computational study

Castillo-Salazar, J. Arturo; Landa-Silva, Dario; Qu, Rong

Workforce scheduling and routing problems: literature survey and computational study Thumbnail


Authors

J. Arturo Castillo-Salazar

Profile Image

DARIO LANDA SILVA DARIO.LANDASILVA@NOTTINGHAM.AC.UK
Professor of Computational Optimisation

Profile Image

RONG QU rong.qu@nottingham.ac.uk
Professor of Computer Science



Abstract

In the context of workforce scheduling, there are many scenarios in which personnel must carry out tasks at different locations hence requiring some form of transportation. Examples of these type of scenarios include nurses visiting patients at home, technicians carrying out repairs at customers’ locations and security guards performing rounds at different premises, etc. We refer to these scenarios as workforce scheduling and routing problems (WSRP) as they usually involve the scheduling of personnel combined with some form of routing in order to ensure that employees arrive on time at the locations where tasks need to be performed. The first part of this paper presents a survey which attempts to identify the common features of WSRP scenarios and the solution methods applied when tackling these problems. The second part of the paper presents a study on the computational difficulty of solving these type of problems. For this, five data sets are gathered from the literature and some adaptations are made in order to incorporate the key features that our survey identifies as commonly arising in WSRP scenarios. The computational study provides an insight into the structure of the adapted test instances, an insight into the effect that problem features have when solving the instances using mathematical programming, and some benchmark computation times using the Gurobi solver running on a standard personal computer.

Citation

Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. (2016). Workforce scheduling and routing problems: literature survey and computational study. Annals of Operations Research, 239(1), 39-67. https://doi.org/10.1007/s10479-014-1687-2

Journal Article Type Article
Acceptance Date Aug 1, 2014
Online Publication Date Aug 14, 2014
Publication Date Apr 1, 2016
Deposit Date Jun 10, 2016
Publicly Available Date Jun 10, 2016
Journal Annals of Operations Research
Print ISSN 0254-5330
Electronic ISSN 1572-9338
Publisher Springer Verlag
Peer Reviewed Peer Reviewed
Volume 239
Issue 1
Pages 39-67
DOI https://doi.org/10.1007/s10479-014-1687-2
Public URL https://nottingham-repository.worktribe.com/output/777523
Publisher URL http://link.springer.com/article/10.1007%2Fs10479-014-1687-2
Additional Information The final publication is available at Springer via http://dx.doi.org/10.1007/s10479-014-1687-2

Files





You might also like



Downloadable Citations