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

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

Evolutionary computation - 1 Jan 1998

Droste S, Jansen T, Wegener I

Abstract excerpt

Evolutionary algorithms (EAs) are heuristic randomized algorithms which, by many impressive experiments, have been proven to behave quite well for optimization problems of various kinds. In this paper a rigorous theoretical complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with Boolean inputs is given. Different mutation rates are compared, and the use of the crossover operator is...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Crossing Over, Genetic
Share to Models, Genetic

Methodology Data sources Editorial policy Privacy Delete account & data About Contact Helena Bioinformatics

Share to Mutation

Source

Identifiers

PMID: 10021746
DOI: 10.1162/evco.1998.6.2.185

Provenance

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

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence. Graph snapshot: 2026-09-29.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

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

Runtime analysis of the (mu+1) EA on simple Pseudo-Boolean functions.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 ↗

Evolving evolutionary algorithms using linear genetic programming.Semantic proximity Read ↗

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

Chemical genetic algorithms--evolutionary optimization of binary-to-real-value translation in genetic algorithms.Semantic proximity Read ↗

Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem.Semantic proximity Read ↗

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

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

Theoretical analysis of mutation-adaptive evolutionary algorithms.Semantic proximity Read ↗

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

Contributions to Dynamic Analysis of Differential Evolution Algorithms.Semantic proximity Read ↗

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