A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem

  • Rodrigo Lankaites Pinheiro
  • Dario Landa-Silva
  • Jason Atkin
Conference paper

DOI: 10.1007/978-3-319-27400-3_22

Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 419)
Cite this paper as:
Pinheiro R.L., Landa-Silva D., Atkin J. (2016) A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem. In: Pillay N., Engelbrecht A., Abraham A., du Plessis M., Snášel V., Muda A. (eds) Advances in Nature and Biologically Inspired Computing. Advances in Intelligent Systems and Computing, vol 419. Springer, Cham

Abstract

The workforce scheduling and routing problem (WSRP) is a combinatorial optimisation problem where a set of workers must perform visits to geographically scattered locations. We present a Variable Neighbourhood Search (VNS) metaheuristic algorithm to tackle this problem, incorporating two novel heuristics tailored to the problem-domain. The first heuristic restricts the search space using a priority list of candidate workers and the second heuristic seeks to reduce the violation of specific soft constraints. We also present two greedy constructive heuristics to give the VNS a good starting point. We show that the use of domain-knowledge in the design of the algorithm can provide substantial improvements in the quality of solutions. The proposed VNS provides the first benchmark results for the set of real-world WSRP scenarios considered.

Keywords

Workforce scheduling and routing problems Home healthcare scheduling Variable neighbourhood search constructive heuristics 

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Rodrigo Lankaites Pinheiro
    • 1
  • Dario Landa-Silva
    • 1
  • Jason Atkin
    • 1
  1. 1.School of Computer Science, ASAP Research GroupThe University of NottinghamNottinghamUK

Personalised recommendations