Population size versus runtime of a simple evolutionary algorithm

DOI10.1016/J.TCS.2008.05.011zbMath1155.68075DBLPjournals/tcs/Witt08OpenAlexW2048019332WikidataQ57200659 ScholiaQ57200659MaRDI QIDQ2518379

Carsten Witt

Publication date: 15 January 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.05.011

zbMATH Keywords

evolutionary algorithmspopulation sizeruntime analysis

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (8)

Towards a runtime comparison of natural and artificial evolution ⋮ Self-adjusting evolutionary algorithms for multimodal optimization ⋮ A tight runtime analysis for the \((\mu + \lambda)\) EA ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ Runtime analysis of the \((1+1)\) EA on computing unique input output sequences ⋮ Do additional target points speed up evolutionary algorithms? ⋮ Global versus local search: the impact of population sizes on evolutionary algorithm performance ⋮ Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real royal road functions for constant population size
• Towards an analytic framework for analysing the computation time of evolutionary algorithms
• On the analysis of the \((1+1)\) evolutionary algorithm
• How to analyse evolutionary algorithms.
• Theory of evolutionary algorithms: A bird's eye view
• Real royal road functions -- where crossover provably is essential
• Upper and lower bounds for randomized search heuristics in black-box optimization
• On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
• STACS 2005
• Theory of genetic algorithms

This page was built for publication: Population size versus runtime of a simple evolutionary algorithm