Selecting genetic operators to maximise preference satisfaction in a workforce scheduling and routing problem
The Workforce Scheduling and Routing Problem (WSRP) is a combinatorial optimisation problem that involves scheduling and routing of workforce. Tackling this type of problem often requires handling a considerable number of requirements, including customers and workers preferences while minimising bot...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Scitepress
2017
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/41539/ |