We introduce the pickup and delivery traveling salesman problem with handling costs.
It is shown that the problem generalizes two existing problem classes.
We propose a large neighborhood search heuristic and introduce new removal operators.
The heuristic is shown to provide optimal or near-optimal solutions.
We report new best known solutions for 67 instances on special cases of the problem.