In this paper the Traveling Salesman Problem with pickup, delivery and handling costs is studied. We have to find a route from a depot to a set of customers, each of which requires a pickup and delivery service the goal is to minimize the global routing and handling cost. We have developed an Iterated Local Search for this problem combining different heuristics of the Traveling Salesman Problem, and using frequency of improvements and a perturbation with memory the proposed algorithm is tested on different benchmark instances from the literature with up to 200 vertices, obtaining high quality solutions in reasonable computing times.
|Title of host publication||2020 39th International Conference of the Chilean Computer Science Society, SCCC 2020|
|Publisher||IEEE Computer Society|
|Publication status||Published - 9 Dec 2020|
|Event||39th International Conference of the Chilean Computer Science Society, SCCC 2020 - Coquimbo, Chile|
Duration: 16 Nov 2020 → 20 Nov 2020
|Name||Proceedings - International Conference of the Chilean Computer Science Society, SCCC|
|Conference||39th International Conference of the Chilean Computer Science Society, SCCC 2020|
|Period||16/11/20 → 20/11/20|
Bibliographical noteFunding Information:
This work was funded by the National Agency for Research and Development (ANID)/ Scholarship Program/Doctorado Becas Chile/2018-72190600.
© 2020 IEEE.
Copyright 2020 Elsevier B.V., All rights reserved.
- Combinatorial Optimization
- Handling Cost
- Iterated Local Search
- Traveling Salesman Problem