Self-Adjusting Evolutionary Algorithms for Multimodal Optimization

Autor: Amirhossein Rajabi, Carsten Witt

Publikováno v: GECCO
Rajabi, A & Witt, C 2020, Self-adjusting evolutionary algorithms for multimodal optimization . in Proceedings of the 2020 Genetic and Evolutionary Computation Conference . Association for Computing Machinery, pp. 1314-1322, 2020 Genetic and Evolutionary Computation Conference, Cancun, Mexico, 08/07/2020 . https://doi.org/10.1145/3377930.3389833

Recent theoretical research has shown that self-adjusting and self-adaptive mechanisms can provably outperform static settings in evolutionary algorithms for binary search spaces. However, the vast majority of these studies focuses on unimodal functi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c3fe6e3fcb5476c3a63d55d1a9ce80e
https://doi.org/10.1007/s00453-022-00933-z

The compact genetic algorithm struggles on Cliff functions

Autor: Frank Neumann, Dirk Sudholt, Carsten Witt

Publikováno v: Proceedings of the Genetic and Evolutionary Computation Conference.

The compact genetic algorithm (cGA) is an non-elitist estimation of distribution algorithm which has shown to be able to deal with difficult multimodal fitness landscapes that are hard to solve by elitist algorithms. In this paper, we investigate the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad88c35aa1f1a98f976c21822e18ea52
https://doi.org/10.1145/3512290.3528776

Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint

Autor: Frank Neumann, Mojgan Pourhassan, Carsten Witt

Publikováno v: GECCO
Neumann, F, Pourhassan, M & Witt, C 2019, Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint . in Proceedings of the 2019 Genetic and Evolutionary Computation Conference . Association for Computing Machinery, GECCO 2019-Proceedings of the 2019 Genetic and Evolutionary Computation Conference, pp. 1506-1514, 2019 Genetic and Evolutionary Computation Conference, Prague, Czech Republic, 13/07/2019 . https://doi.org/10.1145/3321707.3321722

In the last decade remarkable progress has been made in development of suitable proof techniques for analysing randomised search heuristics. The theoretical investigation of these algorithms on classes of functions is essential to the understanding o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c66ab13925482066db6fac0a44188fc
https://doi.org/10.1007/s00453-020-00779-3

Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem

Autor: Benjamin Doerr, Amirhossein Rajabi, Carsten Witt

Publikováno v: Doerr, B, Rajabi, A & Witt, C 2022, Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem . in Proceedings of the 2022 Genetic and Evolutionary Computation Conference . Association for Computing Machinery, pp. 1381-1389, 2022 Genetic and Evolutionary Computation Conference, United States, 09/07/2022 . https://doi.org/10.1145/3512290.3528812

We prove that Simulated Annealing with an appropriate cooling schedule computes arbitrarily tight constant-factor approximations to the minimum spanning tree problem in polynomial time. This result was conjectured by Wegener (2005). More precisely, d

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::961c7c20c9eb38d4e152d59fbf747534

Stagnation Detection in Highly Multimodal Fitness Landscapes

Autor: Amirhossein Rajabi, Carsten Witt

Publikováno v: GECCO

Stagnation detection has been proposed as a mechanism for randomized search heuristics to escape from local optima by automatically increasing the size of the neighborhood to find the so-called gap size, i.e., the distance to the next improvement. It

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e70bd6aae59a74589cac78e568c0260
http://arxiv.org/abs/2104.04395