Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Runtime analysis of the (mu+1) EA on simple Pseudo-Boolean functions.

Evolutionary computation - 1 Jan 2006

Witt Carsten

Abstract excerpt

Although Evolutionary Algorithms (EAs) have been successfully applied to optimization in discrete search spaces, theoretical developments remain weak, in particular for population-based EAs. This paper presents a first rigorous analysis of the (mu+1) EA on pseudo-Boolean functions. Using three well-known example functions from the analysis of the (1+1) EA, we derive bounds on the expected runtime and success...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Biological Evolution
Share to Computer Simulation

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Models, Genetic

Share to Models, Statistical

Share to Mutation

Share to Pedigree

Share to Sensitivity and Specificity

Source

Identifiers

PMID: 16536891
DOI: 10.1162/evco.2006.14.1.65

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-07.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Runtime analysis of the (mu+1) EA on simple Pseudo-Boolean functions.PMID 16536891Read ↗

A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with Boolean inputs.Semantic proximity Read ↗

Unbiased Black-Box Complexities of Jump Functions.Semantic proximity Read ↗

Fitness Probability Distribution of Bit-Flip Mutation.Semantic proximity Read ↗

On Proportions of Fit Individuals in Population of Mutation-Based Evolutionary Algorithm with Tournament Selection.Semantic proximity Read ↗

On the choice of the parent population size.Semantic proximity Read ↗

An Analytical Framework for Runtime of a Class of Continuous Evolutionary Algorithms.Semantic proximity Read ↗

Convergence of simple genetic algorithms for the two-bit problem.Semantic proximity Read ↗

Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search.Semantic proximity Read ↗

The Cost of Randomness in Evolutionary Algorithms: Crossover Can Save Random Bits.Semantic proximity Read ↗

Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift.Semantic proximity Read ↗

Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives.Semantic proximity Read ↗

On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.