Abstract
Premature convergence can be detrimental to the performance of search methods, which is why many search algorithms include restart strategies to deal with it. While it is common to perturb the incumbent solution with diversification steps of various sizes with the hope that the search method will find a new basin of attraction leading to a better local optimum, it is usually not clear whether this strategy is effective. To establish a connection between restart effectiveness and properties of a problem, we introduce a new property of fitness landscapes termed Neighbours with Similar Fitness. We conjecture that this property is true for many PLS (polynomial-time local search)-complete problems, and we demonstrate that the effectiveness of a restart strategy depends on this property.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2022 Genetic and Evolutionary Computation Conference Companion |
Editors | Jonathan Fieldsend |
Place of Publication | New York NY USA |
Publisher | Association for Computing Machinery (ACM) |
Pages | 172-175 |
Number of pages | 4 |
ISBN (Electronic) | 9781450392686 |
DOIs | |
Publication status | Published - 2022 |
Event | The Genetic and Evolutionary Computation Conference 2022 - Online, Boston, United States of America Duration: 9 Jul 2022 → 13 Jul 2022 https://dl.acm.org/doi/proceedings/10.1145/3520304 (Proceedings) https://gecco-2022.sigevo.org/HomePage (Website) |
Conference
Conference | The Genetic and Evolutionary Computation Conference 2022 |
---|---|
Abbreviated title | GECCO 2022 |
Country/Territory | United States of America |
City | Boston |
Period | 9/07/22 → 13/07/22 |
Internet address |
|
Keywords
- local search
- restart strategies