Erdoğan, GüneşBattarra, M.Laporte, G.Vigo, D.2012-08-022012-08-022012-050305-0548http://hdl.handle.net/10679/224https://doi.org/10.1016/j.cor.2011.07.013Due to copyright restrictions, the access to the full text of this article is only available via subscription.This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. The subproblem of minimizing the handling cost for a fixed route is analyzed in detail. It is solved by means of an exact dynamic programming algorithm with quadratic complexity and by an approximate linear time algorithm. Three metaheuristics integrating these solution methods are developed. These are based on tabu search, iterated local search and iterated tabu search. The three heuristics are tested and compared on instances adapted from the related literature. The results show that the combination of tabu search and exact dynamic programming performs the best, but using the approximate linear time algorithm considerably decreases the CPU time at the cost of slightly worse solutions.engrestrictedAccessarticle3951074108600029600060001910.1016/j.cor.2011.07.013Traveling salesman problemHandling costPickup and deliveryMetaheuristics2-s2.0-80052271033