Paper Info
Title
An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs
Abstract
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.
Year
DOI
Venue
2020
10.1109/SCCC51225.2020.9281164
2020 39th International Conference of the Chilean Computer Science Society (SCCC)
Keywords
DocType
ISSN
Traveling Salesman Problem,Combinatorial Optimization,Iterated Local Search,Handling Cost
Conference
1522-4902
ISBN
Citations 
PageRank 
978-1-7281-8329-9
0
0.34
References 
Authors
9
3
Name
Order
Citations
PageRank
Carlos Rey100.34
Paolo Toth22336252.94
Daniele Vigo32054149.20