loading
Papers Papers/2020

Research.Publish.Connect.

Paper

Paper Unlock

Authors: J. Arturo Castillo-Salazar ; Dario Landa-Silva and Rong Qu

Affiliation: The University of Nottingham, United Kingdom

ISBN: 978-989-758-017-8

ISSN: 2184-4372

Keyword(s): Workforce Scheduling and Routing, Mathematical Programming, Benchmark Datasets and Results.

Related Ontology Subjects/Areas/Topics: Applications ; Methodologies and Technologies ; Operational Research ; Pattern Recognition ; Resource Allocation ; Routing ; Scheduling ; Software Engineering

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. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.239.56.184

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Arturo Castillo-Salazar, J.; Landa-Silva, D. and Qu, R. (2014). Computational Study for Workforce Scheduling and Routing Problems. In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - ICORES, ISBN 978-989-758-017-8 ISSN 2184-4372, pages 434-444. DOI: 10.5220/0004833904340444

@conference{icores14,
author={J. {Arturo Castillo{-}Salazar}. and Dario Landa{-}Silva. and Rong Qu.},
title={Computational Study for Workforce Scheduling and Routing Problems},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - ICORES,},
year={2014},
pages={434-444},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004833904340444},
isbn={978-989-758-017-8},
issn={2184-4372},
}

TY - CONF

JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - ICORES,
TI - Computational Study for Workforce Scheduling and Routing Problems
SN - 978-989-758-017-8
IS - 2184-4372
AU - Arturo Castillo-Salazar, J.
AU - Landa-Silva, D.
AU - Qu, R.
PY - 2014
SP - 434
EP - 444
DO - 10.5220/0004833904340444

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.