Escaping Local Optima With Local Search: A Theory-Driven Discussion - Archive ouverte HAL Access content directly
Conference Papers Year : 2022

Escaping Local Optima With Local Search: A Theory-Driven Discussion

Abstract

Local search is the most basic strategy in optimization settings when no specific problem knowledge is employed. While this strategy finds good solutions for certain optimization problems, it generally suffers from getting stuck in local optima. This stagnation can be avoided if local search is modified. Depending on the optimization landscape, different modifications vary in their success. We discuss several features of optimization landscapes and give analyses as examples for how they affect the performance of modifications of local search. We consider modifying random local search by restarting it and by considering larger search radii. The landscape features we analyze include the number of local optima, the distance between different optima, as well as the local landscape around a local optimum. For each feature, we show which modifications of local search handle them well and which do not.
Fichier principal
Vignette du fichier
main--final.pdf (845.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03703829 , version 1 (24-06-2022)

Identifiers

  • HAL Id : hal-03703829 , version 1

Cite

Tobias Friedrich, Timo Kötzing, Martin S Krejca, Amirhossein Rajabi. Escaping Local Optima With Local Search: A Theory-Driven Discussion. Parallel Problem Solving from Nature (PPSN) XVII, Sep 2022, Dortmund, Germany. ⟨hal-03703829⟩
29 View
99 Download

Share

Gmail Facebook Twitter LinkedIn More