2019
DOI: 10.1162/evco_a_00227
|View full text |Cite
|
Sign up to set email alerts
|

Anatomy of the Attraction Basins: Breaking with the Intuition

Abstract: Solving combinatorial optimization problems efficiently requires the development of algorithms that consider the specific properties of the problems. In this sense, local search algorithms are designed over a neighborhood structure that partially accounts for these properties. Considering a neighborhood, the space is usually interpreted as a natural landscape, with valleys and mountains. Under this perception, it is commonly believed that, if maximizing, the solutions located in the slopes of the same mountain… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

4
19
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(23 citation statements)
references
References 48 publications
4
19
0
Order By: Relevance
“…The number of local optima in the fitness landscape provides a first information about the difficulty of a combinatorial optimization problem, and about the performance of local and evolutionary search algorithms [8]. For large landscapes, different methods allow one to estimate the number of local optima using uniform random sampling, biased random sampling [1,7], or the length of an adaptive walk before being trapped [11].…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…The number of local optima in the fitness landscape provides a first information about the difficulty of a combinatorial optimization problem, and about the performance of local and evolutionary search algorithms [8]. For large landscapes, different methods allow one to estimate the number of local optima using uniform random sampling, biased random sampling [1,7], or the length of an adaptive walk before being trapped [11].…”
Section: Preliminariesmentioning
confidence: 99%
“…For large landscapes, different methods allow one to estimate the number of local optima using uniform random sampling, biased random sampling [1,7], or the length of an adaptive walk before being trapped [11]. In addition to the number of local optima, the size, the distribution and the structure of local optima's basins of attraction is one major feature related to algorithm performance [5,8], including for problems from machine learning [3]. The basin of attraction of a local optimum x is defined as the set of solutions from which a hill-climbing algorithm h falls into:…”
Section: Preliminariesmentioning
confidence: 99%
“…In brief, a basin of attraction of an optima is a subset of connected solutions that lead to a local optima when a steepest ascent hill-climbing algorithm is applied. Hernando et al in [6] study the shape of the fitness landscape and the attraction basins' anatomy on combinatorial problems, and suggest how to enhance the design of future algorithms. The authors mention that local search based algorithms get stuck on plateaus or a local optima, although these are generally connected to neighbouring solutions that belong to more favourable basins of attractions.…”
Section: Introductionmentioning
confidence: 99%
“…Literature presents a wide variety of perturbation strategies to avoid getting trapped in a given attraction basin [6]. In this paper, we use the fitness landscape rotation as a perturbation technique to redirect an algorithm that is stuck in a local optima.…”
Section: Introductionmentioning
confidence: 99%
“…While other heuristic techniques have been developed for particular permutation-based combinatorial optimization problems (Stützle, 2006;Schiavinotto and Stützle, 2005;Santucci and Ceberio, 2020). In the last few decades, researchers have seen the necessity to carry out landscape analyses more than to continue to propose new algorithms without knowledge about the problem at hand (Hernando et al, 2019a(Hernando et al, , 2018Albrecht et al, 2008;Alyahya and Rowe, 2014;Chicano et al, 2012;Humeau et al, 2013;Schiavinotto and Stützle, 2003).…”
Section: Introductionmentioning
confidence: 99%