Self-adjusting evolutionary algorithms for multimodal optimization

DOI10.1007/S00453-022-00933-ZzbMath1490.68307arXiv2004.03266OpenAlexW4220673243MaRDI QIDQ2144276

Carsten Witt, Amirhossein Rajabi

Publication date: 1 June 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.03266

zbMATH Keywords

runtime analysisrandomized search heuristicsmultimodal functionsself-adjusting algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (8)

Decomposition-based multiobjective optimization for nonlinear equation systems with many and infinitely many roots ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Lower bounds from fitness levels made easy ⋮ Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution ⋮ An extended jump functions benchmark for the analysis of randomized search heuristics ⋮ Runtime analysis for permutation-based evolutionary algorithms ⋮ Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function ⋮ Stagnation detection meets fast mutation

Cites Work

• Unnamed Item
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Analyzing evolutionary algorithms. The computer science perspective.
• On the analysis of the \((1+1)\) evolutionary algorithm
• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
• Static and self-adjusting mutation strengths for multi-valued decision variables
• Stagnation detection with randomized local search
• Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
• Population size versus runtime of a simple evolutionary algorithm
• Runtime analysis for self-adaptive mutation rates
• Hitting-time and occupation-time bounds implied by drift analysis with applications
• Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
• The benefits and limitations of voting mechanisms in evolutionary optimisation
• A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones
• Theory of Evolutionary Computation
• Adaptive population models for offspring populations and parallel evolutionary algorithms

This page was built for publication: Self-adjusting evolutionary algorithms for multimodal optimization