Skip to Main content Skip to Navigation
Journal articles

Iterated Local Search

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas
Contributor : Claudine Le Vaou <>
Submitted on : Thursday, December 2, 2004 - 11:38:36 AM
Last modification on : Wednesday, September 16, 2020 - 4:04:23 PM

Links full text




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



Record views