A variable neighbourhood search for the workforce scheduling and routing problem
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 heuri...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Book Section |
| Published: |
Springer
2015
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/31300/ |