The runtime of the compact genetic algorithm on jump functions
From MaRDI portal
Publication:2240129
DOI10.1007/s00453-020-00780-wOpenAlexW3101149728MaRDI QIDQ2240129
Publication date: 5 November 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.06527
combinatorial optimizationlocal optimaruntime analysisestimation-of-distribution algorithmparallel runs
Related Items (6)
A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions ⋮ Choosing the right algorithm with hints from complexity theory ⋮ 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 ⋮ How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
Cites Work
- From black-box complexity to designing new genetic algorithms
- Ranking-based black-box complexity
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Analyzing evolutionary algorithms. The computer science perspective.
- Simplified drift analysis for proving lower bounds in evolutionary computation
- A rigorous analysis of the compact genetic algorithm for linear functions
- On the analysis of the \((1+1)\) evolutionary algorithm
- Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax
- On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
- The query complexity of a permutation-based variant of mastermind
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- Multiplicative drift analysis
- Black-box search by unbiased variation
- Working principles of binary differential evolution
- The univariate marginal distribution algorithm copes well with deception and epistasis
- Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax
- When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms
- The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax
- Analyzing randomized search heuristics via stochastic domination
- Upper and lower bounds for randomized search heuristics in black-box optimization
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
- An exponential lower bound for the runtime of the compact genetic algorithm on jump 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
- Black-box search by elimination of fitness functions
- Approximating vertex cover using edge-based representations
- Probability Inequalities for Sums of Bounded Random Variables
- Automata, Languages and Programming
- Drift analysis and average time complexity of evolutionary algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The runtime of the compact genetic algorithm on jump functions
