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.

49 pages

Cited by in corpus (20)

• Local Optima Networks: A New Model of Combinatorial Fitness Landscapes
• A hybrid adaptive Iterated Local Search with diversification control to the Capacitated Vehicle Routing Problem
• A Joint Quantile and Expected Shortfall Regression Framework
• Metaheuristics for the Online Printing Shop Scheduling Problem
• Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
• Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search
• How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines
• Multi-Vehicle Routing Problems with Soft Time Windows: A Multi-Agent Reinforcement Learning Approach
• Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
• Iterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem
• Iterated Tabu Search Algorithm for Packing Unequal Circles in a Circle
• An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization
• A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows
• Control of Functional Connectivity in Cerebral Cortex by Basal Ganglia Mediated Synchronization
• Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling Salesman Problems
• Memetic Algorithms: Parametrization and Balancing Local and Global Search
• A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem
• Q-Graph: Preserving Query Locality in Multi-Query Graph Processing
• Lifted Graphical Models: A Survey
• A Component Based Heuristic Search method with Adaptive Perturbations for Hospital Personnel Scheduling