A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW
The Vehicle Routing Problem with Time Windows (VRPTW) consists of constructing least cost routes from a depot to a set of geographically scattered service points and back to the depot, satisfying service time interval and capacity constraints. A Variable Neighbourhood Search algorithm with Compound...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2016
|
| Online Access: | https://eprints.nottingham.ac.uk/33886/ |