Work

Iterated Local Search

Year: 2006

Type: book-chapter

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.

Source: Kluwer Academic Publishers eBooks

Parent work: Handbook of Metaheuristics

DOI: 10.1007/0-306-48056-5_11

Authors: Helena R. Lourenço, Olivier C. Martin, Thomas Stützle

Institutions: Universitat Pompeu Fabra, Université Paris-Sud, Technische Universität Darmstadt

Language: English

Topic: Metaheuristic Optimization Algorithms Research

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Institut Universitaire de France