Large Neighborhood Search for Variants of TSP

To solve problems with Local Search procedures, neighborhoods have to be defined. During the resolution, a solution is typically replaced by the best solution found in its neighborhood. A question concerns the size of the neighborhood. If a small neighborhood can be explored in polynomial time, a large neighborhood search may bring a faster convergence to a local optimum of good quality. In this paper, we propose a class of large neighborhood search which can be implemented on some extensions of the Traveling Salesman Problem.