A Beginner ’ s Introduction to Iterated Local Search

  title={A Beginner ’ s Introduction to Iterated Local Search},
  author={Helena R. Lourenço and O. C. Martin and Thomas St{\"u}tzle},
The importance of high performance algorithms for tackling NP-hard optimization problems cannot be understated, and in many practical cases the most successful methods are metaheuristics. When designing a metaheuristic, it is preferable that it be simple, both conceptually and in practice. Naturally, it also must be effective, and if possible, general purpose. Iterated local search (ILS) is such a metaheuristic; its essence can be given in a nut-shell: one iteratively builds a sequence of… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 28 extracted citations

Scheduling content multicast trees with minimal repetitions

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) • 2010
View 3 Excerpts
Highly Influenced

An energy-aware mapping algorithm for mesh-based network-on-chip architectures

2017 International Conference on Progress in Informatics and Computing (PIC) • 2017
View 1 Excerpt


Publications referenced by this paper.
Showing 1-10 of 18 references

The travelling salesman problem: A case study in local optimization

D. S. Johnson, L. A. McGeoch
Local Search in Combinatorial Optimization, • 1997
View 5 Excerpts
Highly Influenced

Local Optimization and the Traveling Salesman Problem

ICALP • 1990
View 4 Excerpts
Highly Influenced

Heuristics for minimizing total weighted tardiness in flexible flow shops

Y. Yang, S. Kreipl, M. Pinedo
Journal of Scheduling, • 2000
View 1 Excerpt

Cut Size Statistics of Graph Bisection Heuristics

SIAM Journal on Optimization • 1999
View 1 Excerpt

Guided local search with shifting bottleneck for job shop scheduling

E. Balas, A. Vazacopoulos
Management Science, • 1998
View 1 Excerpt

Similar Papers

Loading similar papers…