Tight bounds on the expected runtime of a standard steady state genetic algorithm

DOI10.1007/s00453-021-00893-wOpenAlexW4200034809MaRDI QIDQ2144273

Dirk Sudholt, Pietro S. Oliveto, Carsten Witt

Publication date: 1 June 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-021-00893-w

zbMATH Keywords

lower boundsevolutionary algorithmscrossoverruntime analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)

Related Items (1)

The cost of randomness in evolutionary algorithms: crossover can save random bits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Crossover can be constructive when computing unique input-output sequences
• Crossover can provably be useful in evolutionary computation
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Analyzing evolutionary algorithms. The computer science perspective.
• Improved time complexity analysis of the simple genetic algorithm
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• Black-box search by unbiased variation
• On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
• On the runtime analysis of the simple genetic algorithm
• Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
• A note on the mean deviation of the binomial distribution
• Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
• Theory of Evolutionary Computation
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Tight bounds on the expected runtime of a standard steady state genetic algorithm