Iterated Local Search
About
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.
H.R. Lourenco, O.C. Martin, T. Stutzle• 2001
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Job Shop Scheduling | JSSP ft, la, abz, orb, ta instances | Optimality Gap0.00e+0 | 56 | |
| Quadratic Assignment Problem | QAP (Quadratic Assignment Problem) Cross-domain Transfer nug12-30, tai20a-256c | Gap (%)0.00e+0 | 33 | |
| Combinatorial Optimization | MIS | Solution Gap (%)19.11 | 15 | |
| Combinatorial Optimization | FJSP | Objective Value (x10^4)1.50e+4 | 14 | |
| Combinatorial Optimization | CVRP | Objective Value ($10^5$)1.18 | 14 | |
| Combinatorial Optimization | CFLP | Objective Value (10^5)8.36 | 14 |
Showing 6 of 6 rows