A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem

@inproceedings{Pinheiro2015AVN,
  title={A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem},
  author={Rodrigo Lankaites Pinheiro and Dario Landa Silva and Jason Atkin},
  booktitle={NaBIC},
  year={2015}
}
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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

A genetic algorithm for a workforce scheduling and routing problem

  • 2016 IEEE Congress on Evolutionary Computation (CEC)
  • 2016
VIEW 5 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS

Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem

Haneen Algethami, Anna Martínez-Gavara, Dario Landa Silva
  • J. Heuristics
  • 2019
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Diversity-based adaptive genetic algorithm for a Workforce Scheduling and Routing Problem

  • 2017 IEEE Congress on Evolutionary Computation (CEC)
  • 2017
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

Variable Neighborhood Search

N Mladenovir, E Hansen 't
  • Lecture Notes in Computer Science
  • 2018
VIEW 1 EXCERPT