An extended jump functions benchmark for the analysis of randomized search heuristics

DOI10.1007/s00453-022-00977-1arXiv2105.03090WikidataQ114229328 ScholiaQ114229328MaRDI QIDQ6185933

Benjamin Doerr, Henry Bambury, Antoine Bultel

Publication date: 9 January 2024

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

benchmarksevolutionary computationtheoryruntime analysis

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Crossover can be constructive when computing unique input-output sequences
• Crossover can provably be useful in evolutionary computation
• From black-box complexity to designing new genetic algorithms
• When a genetic algorithm outperforms hill-climbing
• 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
• Solving problems with unknown solution length at almost no extra cost
• How to escape local optima in black box optimisation: when non-elitism outperforms elitism
• Static and self-adjusting mutation strengths for multi-valued decision variables
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• More effective crossover operators for the all-pairs shortest path problem
• Self-adjusting evolutionary algorithms for multimodal optimization
• Fast mutation in crossover-based algorithms
• When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms
• On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
• Stagnation detection with randomized local search
• The runtime of the compact genetic algorithm on jump functions
• The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax
• Towards a runtime comparison of natural and artificial evolution
• Analyzing randomized search heuristics via stochastic domination
• On the Black-Box Complexity of Example Functions
• Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
• The benefits and limitations of voting mechanisms in evolutionary optimisation
• On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help
• Theory of Evolutionary Computation
• Faster black-box algorithms through higher arity operators
• Stagnation detection meets fast mutation
• Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations