Paper Info
Title
A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem.
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.
Year
DOI
Venue
2015
10.1007/978-3-319-27400-3_22
ADVANCES IN NATURE AND BIOLOGICALLY INSPIRED COMPUTING
Keywords
Field
DocType
Workforce scheduling and routing problems,Home healthcare scheduling,Variable neighbourhood search,constructive heuristics
Workforce scheduling,Heuristic,Mathematical optimization,Computer science,Neighbourhood (mathematics),Heuristics,Constructive heuristic,Metaheuristic
Conference
Volume
ISSN
Citations 
419
2194-5357
3
PageRank 
References 
Authors
0.37
8
3
Name
Order
Citations
PageRank
Rodrigo Lankaites Pinheiro193.23
Dario Landa Silva231628.38
Jason A. D. Atkin317919.85