Greedy heuristic for the workforce scheduling and routing problem
The Workforce Scheduling and Routing Problem deals with the assignment of work¬ers to tasks throughout the course of the day, where each task is at a different geo¬graphical location. It is a problem that occurs frequently in the real world, with many different variations, that are usually tackled i...
| Main Author: | |
|---|---|
| Format: | Dissertation (University of Nottingham only) |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/48556/ |