Iterated Local Search

@inproceedings{Lourenc2000IteratedLS,
  title={Iterated Local Search},
  author={Helena R. Lourenc and helena. ramalhinho and O. C. Martin},
  year={2000}
}
  • Helena R. Lourenc, helena. ramalhinho, O. C. Martin
  • Published 2000
Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the solutions that are locally optimal for a given optimization engine. The success of Iterated Local Search lies in the biased sampling of this set of local optima. How effective this approach turns out to be… CONTINUE READING

Citations

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

References

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

Lourenc ̧o. Job-shop scheduling: Computational study of local search and large-step optimization methods

  • H R.
  • European Journal of Operational Research,
  • 1995
Highly Influential
4 Excerpts

An introduction to variable neighborhood search

  • P. Hansen, N. Mladenovi ́ c
  • 1999
Highly Influential
6 Excerpts

Search Algorithms for Combinatorial Problems — Analysis, Improvements, and New Applications

  • T. Stützle.Local
  • PhD thesis, Darmstadt University of Technology…
  • 1998
Highly Influential
4 Excerpts

The travelling salesman problem: A case study in local optimization

  • D. S. Johnson, L. A. McGeoch
  • Local Search in Combinatorial Optimization,
  • 1997
Highly Influential
9 Excerpts

Similar Papers

Loading similar papers…