Skip to main content

Research Repository

Advanced Search

Computational study for workforce scheduling and routing problems

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

Authors

J. Arturo Castillo-Salazar

Profile Image

RONG QU rong.qu@nottingham.ac.uk
Associate Professor



Abstract

We present a computational study on 112 instances of the Workforce Scheduling and Routing Problem (WSRP). This problem has applications in many service provider industries where employees visit customers to perform activities. Given their similarity, we adapt a mathematical programming model from the literature on vehicle routing problem with time windows (VRPTW) to conduct this computational study on the WSRP. We generate a set of WSRP instances from a well-known VRPTW data set. This work has three objectives. First, to investigate feasibility and optimality on a range of medium size WSRP instances with different distribution of visiting locations and including teaming and connected activities constraints. Second, to compare the generated WSRP instances to their counterpart VRPTW instances with respect to their difficulty. Third, to determine the computation time required by a mathematical programming solver to find feasible solutions for the generated WSRP instances. It is observed that although the solver can achieve feasible solutions for some instances, the current solver capabilities are still limited. Another observation is the WSRP instances present an increased degree of difficulty because of the additional constraints. The key contribution of this paper is to present some test instances and corresponding benchmark study for the WSRP.

Citation

Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. (2014). Computational study for workforce scheduling and routing problems

Conference Name 3rd International Conference on Operations Research and Enterprise Systems (ICORES 2014)
End Date Mar 8, 2014
Acceptance Date Feb 1, 2014
Publication Date Jan 1, 2014
Deposit Date Jan 22, 2016
Publicly Available Date Jan 22, 2016
Peer Reviewed Peer Reviewed
Keywords personnel scheduling, vehicle routing, exact algorithms, mathematical programming
Public URL http://eprints.nottingham.ac.uk/id/eprint/31326
Publisher URL http://www.scitepress.org/DigitalLibrary/Link.aspx?doi=10.5220/0004833904340444
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf
Additional Information Published in: Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems, ISBN 9789897580178, pages 434-444. DOI: 10.5220/0004833904340444

Files


dls_icores2014_1.pdf (261 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations