Computational Study for Workforce Scheduling and Routing Problems

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

2014

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.

References

  1. Li, Y., Lim, A., and Rodrigues, B. (2005). Manpower allocation with time windows and job-teaming constraints. Naval Research Logistics, 52(4):302-311.
  2. Misir, M., Smet, P., Verbeeck, K., and Vanden Bergue, G. (2011). Security personnel routing and rostering: a hyper-heuristic approach. In Proceedings of the 3rd International Conference on Applied Operational Research, pages 193-206.
  3. Nickel, S., Schröder, M., and Steeg, J. (2012). Mid-term abd short-term planning support for home health care services. European Journal of Operational Research, 219:574-587.
  4. Rasmussen, M. S., Justesen, T., Dohn, A., and Larsen, J. (2012). The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European Journal of Operational Research, 219(3):598-610.
  5. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time windows constraints. Operations Research, 35(2):254-265.
  6. Taillard, E. D., Laporte, G., and Gendreau, M. (1996). Vehicle routeing with multiple use of vehicles. Journal of the Operational Research Society, 47:1065- 1070.
  7. Toth, P. and Vigo, D. (1987). The vehicle routing problem, volume 9. Society for Industrial and Applied Mathematics.
Download


Paper Citation


in Harvard Style

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 - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 434-444. DOI: 10.5220/0004833904340444


in Bibtex Style

@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 - Volume 1: ICORES,},
year={2014},
pages={434-444},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004833904340444},
isbn={978-989-758-017-8},
}


in EndNote Style

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