Lower bounds from fitness levels made easy (Q6182674)

scientific article; zbMATH DE number 7795029

Language	Label	Description	Also known as
English	Lower bounds from fitness levels made easy	scientific article; zbMATH DE number 7795029

Statements

instance of

scholarly article

0 references

title

Lower bounds from fitness levels made easy (English)

0 references

0 references

0 references

0 references

25 January 2024

0 references

full work available at URL

https://arxiv.org/abs/2104.03372

0 references

zbMATH Keywords

first hitting time

0 references

fitness level method

0 references

evolutionary computation

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions

0 references

Fixed-target runtime analysis

0 references

Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem

0 references

When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms

0 references

The impact of random initialization on the runtime of randomized search heuristics

0 references

Static and self-adjusting mutation strengths for multi-valued decision variables

0 references

Optimal parameter choices via precise black-box analysis

0 references

On the analysis of the \((1+1)\) evolutionary algorithm

0 references

Multiplicative drift analysis

0 references

The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time

0 references

Runtime analysis of non-elitist populations: from classical optimisation to partial information

0 references

Analyzing randomized search heuristics via stochastic domination

0 references

Theory of Evolutionary Computation

0 references

Q3241504

0 references

Optimizing expected path lengths with ant colony optimization using fitness proportional update

0 references

The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax

0 references

Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis

0 references

Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools

0 references

Drift analysis and average time complexity of evolutionary algorithms

0 references

Algorithmic analysis of a basic evolutionary algorithm for continuous optimization

0 references

The analysis of evolutionary algorithms -- A proof that crossover really can help

0 references

Performance analysis of randomised search heuristics operating with a fixed budget

0 references

When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not

0 references

Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization

0 references

Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift

0 references

Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links

0 references

Markov Chains and Stochastic Stability

0 references

The benefits and limitations of voting mechanisms in evolutionary optimisation

0 references

Q4370804

0 references

Self-adjusting evolutionary algorithms for multimodal optimization

0 references

Stagnation detection with randomized local search

0 references

The impact of parametrization in memetic evolutionary algorithms

0 references

Q4535010

0 references

Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions

0 references

Fitness levels with tail bounds for the analysis of randomized search heuristics

0 references

Identifiers

arXiv ID

2104.03372

0 references

DOI

10.1007/s00453-022-00952-w

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6182674