An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries
The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the customers and returns to the depot, in such a way that the vehicle capacity is not exceeded in any part...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2013.
|
| Subjects: | |
| Online Access: | Get fulltext |