Iterated local search: framework and applications

The key idea underlying iterated local search is to focus the search not on the full space of all candidate solutions but on the solutions that are returned by some underlying algorithm, typically a local search heuristic. The resulting search behavior can be characterized as iteratively building a...

Descripción completa

Detalles Bibliográficos
Autores: Ramalhinho-Lourenço, Helena, Martin, Olivier C., Stützle, Thomas
Tipo de recurso: capítulo de libro
Estado:Versión aceptada para publicación
Fecha de publicación:2019
País:España
Institución:Universitat Pompeu Fabra
Repositorio:Repositorio Digital de la UPF
OAI Identifier:oai:repositori.upf.edu:10230/69330
Acceso en línea:http://hdl.handle.net/10230/69330
http://dx.doi.org/10.1007/978-3-319-91086-4_5
Access Level:acceso abierto
Palabra clave:Optimització combinatòria
Investigació operativa
Informàtica -- Matemàtica
id ES_913dd2ee0bfa42676f851687f4ecccec
oai_identifier_str oai:repositori.upf.edu:10230/69330
network_acronym_str ES
network_name_str España
repository_id_str
spelling Iterated local search: framework and applicationsRamalhinho-Lourenço, HelenaMartin, Olivier C.Stützle, ThomasOptimització combinatòriaInvestigació operativaInformàtica -- MatemàticaThe key idea underlying iterated local search is to focus the search not on the full space of all candidate solutions but on the solutions that are returned by some underlying algorithm, typically a local search heuristic. The resulting search behavior can be characterized as iteratively building a chain of solutions of this embedded algorithm. The result is also a conceptually simple metaheuristic that nevertheless has led to state-of-the-art algorithms for many computationally hard problems. In fact, very good performance is often already obtained by rather straightforward implementations of the metaheuristic. In addition, the modular architecture of iterated local search makes it very suitable for an algorithm engineering approach where, progressively, the algorithm’s performance can be further optimized. Our purpose here is to give an accessible description of the underlying principles of iterated local search and a discussion of the main aspects that need to be taken into account for a successful application of it. In addition, we review the most important applications of this method and discuss its relationship with other metaheuristics.Helena Ramalhinho Lourenço acknowledges support from the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P, TRA2015-71883-REDT), and Thomas Stützle acknowledges support from the F.R.S.-FNRS, of which he is a research director. This work received support from the COMEX project P7/36 within the Interuniversity Attraction Poles Programme of the Belgian Science Policy Office.SpringerNature202520252019info:eu-repo/semantics/bookPartinfo:eu-repo/semantics/acceptedVersionapplication/pdfapplication/pdfhttp://hdl.handle.net/10230/69330http://dx.doi.org/10.1007/978-3-319-91086-4_5reponame:Repositorio Digital de la UPFinstname:Universitat Pompeu FabraInglésGendreau M, Potvin JY, editors. Handbook of metaheuristics. Cham: Springer International Publishing; 2019. p. 129-68International series in operations research & management scienceinfo:eu-repo/grantAgreement/ES/1PE/TRA2013-48180-C3-Pinfo:eu-repo/grantAgreement/ES/1PE/TRA2015-71883-REDT© SpringerNature This is a author's accepted manuscript of: Ramalhinho Lourenço H, Martin OC, Stützle T. Iterated local search: framework and applications. In: Gendreau M, Potvin JY, editors. Handbook of metaheuristics. Cham: Springer International Publishing; 2019. p. 129-68. DOI: 10.1007/978-3-319-91086-4_5. The final version is available online at: http://dx.doi.org/10.1007/978-3-319-91086-4_5.info:eu-repo/semantics/openAccessoai:repositori.upf.edu:10230/693302026-06-12T07:21:37Z
dc.title.none.fl_str_mv Iterated local search: framework and applications
title Iterated local search: framework and applications
spellingShingle Iterated local search: framework and applications
Ramalhinho-Lourenço, Helena
Optimització combinatòria
Investigació operativa
Informàtica -- Matemàtica
title_short Iterated local search: framework and applications
title_full Iterated local search: framework and applications
title_fullStr Iterated local search: framework and applications
title_full_unstemmed Iterated local search: framework and applications
title_sort Iterated local search: framework and applications
dc.creator.none.fl_str_mv Ramalhinho-Lourenço, Helena
Martin, Olivier C.
Stützle, Thomas
author Ramalhinho-Lourenço, Helena
author_facet Ramalhinho-Lourenço, Helena
Martin, Olivier C.
Stützle, Thomas
author_role author
author2 Martin, Olivier C.
Stützle, Thomas
author2_role author
author
dc.subject.none.fl_str_mv Optimització combinatòria
Investigació operativa
Informàtica -- Matemàtica
topic Optimització combinatòria
Investigació operativa
Informàtica -- Matemàtica
description The key idea underlying iterated local search is to focus the search not on the full space of all candidate solutions but on the solutions that are returned by some underlying algorithm, typically a local search heuristic. The resulting search behavior can be characterized as iteratively building a chain of solutions of this embedded algorithm. The result is also a conceptually simple metaheuristic that nevertheless has led to state-of-the-art algorithms for many computationally hard problems. In fact, very good performance is often already obtained by rather straightforward implementations of the metaheuristic. In addition, the modular architecture of iterated local search makes it very suitable for an algorithm engineering approach where, progressively, the algorithm’s performance can be further optimized. Our purpose here is to give an accessible description of the underlying principles of iterated local search and a discussion of the main aspects that need to be taken into account for a successful application of it. In addition, we review the most important applications of this method and discuss its relationship with other metaheuristics.
publishDate 2019
dc.date.none.fl_str_mv 2019
2025
2025
dc.type.none.fl_str_mv info:eu-repo/semantics/bookPart
info:eu-repo/semantics/acceptedVersion
format bookPart
status_str acceptedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10230/69330
http://dx.doi.org/10.1007/978-3-319-91086-4_5
url http://hdl.handle.net/10230/69330
http://dx.doi.org/10.1007/978-3-319-91086-4_5
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Gendreau M, Potvin JY, editors. Handbook of metaheuristics. Cham: Springer International Publishing; 2019. p. 129-68
International series in operations research & management science
info:eu-repo/grantAgreement/ES/1PE/TRA2013-48180-C3-P
info:eu-repo/grantAgreement/ES/1PE/TRA2015-71883-REDT
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv SpringerNature
publisher.none.fl_str_mv SpringerNature
dc.source.none.fl_str_mv reponame:Repositorio Digital de la UPF
instname:Universitat Pompeu Fabra
instname_str Universitat Pompeu Fabra
reponame_str Repositorio Digital de la UPF
collection Repositorio Digital de la UPF
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869413374705532928
score 15,811543

Similares en LA Referencia