Iterated Local Search

2001/02/23 by H. R. Lourenco, O. C. Martin, T. Stutzle · 6 citations
Mathematics · #math.OC #msc:90C59 #msc:90C27

paper · pdf

published as In "Handbook of Metaheuristics", Ed. F. Glover and G. Kochenberger, ISORMS 57, p 321-353 (2002), Kluwer. · 49 pages

arxiv created 2001/02/23 · arxiv updated 2009/11/30

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.

Cited by

• Optimizing urban greening and densification in the context of outdoor heat: Opportunities for AI-supported urban adaptation
• Ask, Reason, Assist: Robot Collaboration via Natural Language and Temporal Logic
• Sparse Convex Quantile Regression: A Generalized Benders Decomposition Approach
• cuAPO: A CUDA-based Parallelization of Artificial Protozoa Optimizer
• Finding One Local Optimum Is Easy -- but What About Two?
• Random-key genetic algorithms: Principles and applications

Related

• Foundations of the Pareto Iterated Local Search Metaheuristic
• Finding One Local Optimum Is Easy -- but What About Two?
• Simple Local Search Problems that are Hard to Solve
• Modeling Local Search Metaheuristics Using Markov Decision Processes
• When is local search both effective and efficient?