Large Neighborhood Search for Variants of TSP

Boris Bontoux (1) , Dominique Feillet (1) , Christian Artigues (2)

1 LIA - Laboratoire Informatique d'Avignon
2 LAAS-MOGISA

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.

Mots clés: Large neighborhood search; generalized traveling salesman problems; dynamic programming; ant colony optimization

Domaines: Recherche opérationnelle [math.OC]

Boris Bontoux, Dominique Feillet, Christian Artigues. Large Neighborhood Search for Variants of TSP. MIC 2007: The Seventh Metaheuristics International Conference, Jun 2007, Montréal, Canada. pp.CD-Rom. ⟨hal-00250069⟩