Exact and Heuristic Algorithms for the Carrier–Vehicle Traveling Salesman Problem

This paper presents new structural properties for the carrier–vehicle traveling salesman problem. The authors provide a new mixed-integer second-order conic optimization formulation, with associated optimality cuts based on the structural properties, and an iterated local search (ILS) algorithm. Computational experiments on instances from the literature demonstrate the superiority of the new formulation to the existing models and algorithms in the literature, and the high-quality solutions found by the ILS algorithm.