Iterated Local Search

Helena R. Lourenco (1) , Olivier C. Martin (2) , Thomas Stützle (3)

1 IMIM-Hospital del Mar
2 LPTMS - Laboratoire de Physique Théorique et Modèles Statistiques
3 Darmstadt University of Technology [Darmstadt]

This is a survey of "Iterated Local Search", a general purpose metaheuristic for finding good solutions of combinatorial optimization problems. It is based on building a sequence of (locally optimal) solutions by: (1) perturbing the current solution; (2) applying local search to that modified solution. At a high level, the method is simple, yet it allows for a detailed use of problem-specific properties. After giving a general framework, we cover the uses of Iterated Local Search on a number of well studied problems.

Domaines: Optimisation et contrôle [math.OC]

Helena R. Lourenco, Olivier C. Martin, Thomas Stützle. Iterated Local Search. Science Kluwer, 2002, 57, pp.321-353. ⟨hal-00003449⟩