Iterated Local Search

Simple item page
dc.creatorLourenco, H. R.
dc.creatorMartin, O. C.
dc.creatorStutzle, T.
dc.date2001-02-23
dc.date.accessioned2026-07-07T04:40:21Z
dc.date.available2026-07-07T04:40:21Z
dc.descriptionThis 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.
dc.description49 pages
dc.identifierhttps://arxiv.org/abs/math/0102188
dc.identifierhttp://arxiv.org/abs/math/0102188
dc.identifierIn "Handbook of Metaheuristics", Ed. F. Glover and G. Kochenberger, ISORMS 57, p 321-353 (2002), Kluwer.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60998
dc.subjectOptimization and Control
dc.subject90C59, 90C27
dc.titleIterated Local Search
dc.typetext

Files

Collections

arXiv