Evolutionary Algorithm¶

A population-based stochastic search family that repeatedly evaluates encoded candidates, selects parents or survivors, creates heritable variants, and replaces population members.

Version: v3 · 2026-09-19 · History
Domain-specific #: 1801
Domain group: Natural Sciences
Origin domain: Biology & Ecology
Subdomains: Evolutionary Computation, Population Based Metaheuristics → Biology & Ecology
Aliases: EA

Core Idea¶

An evolutionary algorithm is a family of population-based stochastic search and optimization procedures inspired by variation, differential selection, and inheritance. It maintains computationally represented candidate solutions, evaluates their quality or behavior, uses selection to bias which candidates reproduce or survive, creates offspring with representation-compatible variation operators, and updates the population. The cycle continues until a budget, target, convergence test, or other termination condition is met.

Eiben and Smith’s standard decomposition names representation, evaluation, population, parent selection, variation, survivor selection or replacement, initialization, and termination as the core components of an evolutionary algorithm. Their treatment also separates major variants—genetic algorithms, evolution strategies, evolutionary programming, and genetic programming—by representation and operator choices rather than treating one subtype as the entire family.

How would you explain it like I'm…

Try, Keep, Tweak, Repeat

Imagine trying to make the best paper airplane. You fold lots of planes, see which fly farthest, and make new ones by copying the good ones with tiny changes. You do it again and again, and the planes get better. A computer can solve puzzles the same way.

Survival of the Best Answers

An evolutionary algorithm is a computer method for finding good answers to a problem, borrowing ideas from how living things evolve. It keeps a group, or population, of possible answers and scores how good each one is. The better answers are more likely to be picked to make new answers, with small random changes and sometimes mixing two answers together. The new answers replace some old ones, and the cycle repeats until time runs out or the answer is good enough. Just making brand-new random guesses each time doesn't count, because the good answers have to pass something on.

Evaluate-Select-Vary-Replace Loop

An evolutionary algorithm is a family of population-based, random-driven search and optimization methods inspired by variation, selection, and inheritance. It keeps a population of encoded candidate solutions, evaluates each, uses selection to favor better ones for reproduction or survival, creates offspring with variation operators like mutation (and often recombination), and updates the population. The loop is evaluate → select → vary → replace, repeated until a stopping rule is met. Mutation or some heritable variation is required, and selection must actually depend on the scores. Without that, just randomly sampling new candidates each time is plain random search, not an evolutionary algorithm.

An evolutionary algorithm is a family of stochastic, population-based search and optimization procedures inspired by variation, differential selection, and inheritance. A standard decomposition (Eiben and Smith) lists its components: representation, evaluation (fitness), population, parent selection, variation operators, survivor selection or replacement, initialization, and termination. The core recurrence is evaluate → select → vary → replace, with information passed on through offspring representations, and it runs until a budget, target, convergence test, or other termination condition. Major variants, namely genetic algorithms, evolution strategies, evolutionary programming, and genetic programming, differ mainly in representation and operator choices; none is the whole family. Recombination is common but optional; some heritable variation such as mutation is required, and selection must make evaluation consequential. Biological terms are operational labels: 'individuals' are encoded candidates, 'fitness' is a search evaluation, and 'generations' are computation schedules, so the method does not claim to faithfully reproduce natural evolution. Independent random resampling of a population is random search, not an EA.

Cross-Domain Echoes¶

See how this entry connects to another domain.

Scope of Application¶

Evolutionary algorithms are used for black-box, discontinuous, noisy, mixed-variable, combinatorial, multimodal, and multiobjective problems where derivatives or exact solvers are unavailable or inconvenient. They also support design exploration, automated program construction, controller search, scheduling, feature selection, and model calibration.

The family includes generational and steady-state population models, single- and multiobjective evaluation, fixed and self-adaptive operators, constrained optimization, coevolution, interactive evaluation, neuroevolution, and quality-diversity methods. Each extension must still bind representation, evaluation, selection, variation, and population update.

Clarity¶

Representation and solution meaning must be separated. A genotype is the stored object variation operators manipulate; a phenotype is the decoded solution evaluated in the problem domain. They can coincide for a real vector, but tree grammars, indirect encodings, and repair functions make the mapping consequential.

Manages Complexity¶

Large search spaces make enumeration impossible. An EA samples a bounded population, uses evaluations to concentrate future sampling, and preserves variation so search does not reduce immediately to one local trajectory. Recombination can combine material from several candidates; mutation explores nearby or novel regions.

The population carries parallel hypotheses. It can maintain alternative basins, trade-offs, niches, or building blocks and can return a set of solutions rather than one point.

Abstract Reasoning¶

Let \(P_t=\{x_1,\ldots,x_\mu\}\) be the population at iteration \(t\), and let \(E(x)\) be an evaluation. A generic cycle samples parents according to \(S_p(P_t,E)\), applies a variation kernel \(V(\cdot\mid\text{parents})\) to produce offspring \(O_t\), evaluates them, and uses survivor rule \(S_s(P_t,O_t,E)\) to form \(P_{t+1}\).

Knowledge Transfer¶

The EA cycle transfers literally across bit strings, real vectors, permutations, syntax trees, neural-network encodings, and rule sets. The representation-specific operators change, but evaluation-guided selection, inherited variation, and population replacement remain.

Transfer requires operator repair. One-point crossover that is valid for bit strings can destroy permutation validity; Gaussian mutation natural for real vectors is meaningless for syntax trees. A successful transfer preserves feasible representation semantics or adds repair and constraint handling.

Relationships to Other Abstractions¶

Current abstraction Evolutionary Algorithm Domain-specific

Parents (1) — outgoing typed relations

Evolutionary Algorithm is a kind of Algorithm Prime

prime:algorithm is the broader abstraction this entry instantiates.

Children (1) — abstractions linked here by typed relations

Differential Evolution Domain-specific is a kind of Evolutionary Algorithm

DE adds population-difference vector variation to an evaluated population/selection cycle.

Hierarchy path (1) — routes to 1 parentless root

Evolutionary Algorithm → is a kind of Algorithm → presupposes, conditional Function (Mapping)

Neighborhood in Abstraction Space¶

Evolutionary Algorithm sits in a sparse region of the domain-specific corpus (86^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Population Genetics & Selection (11 abstractions)

Nearest neighbors

Premature convergence — 0.82
Evolutionary acquisition of neural topologies — 0.81
Evolutionary Attractor — 0.81
Population-based incremental learning — 0.80
Evolutionary data mining — 0.80

Computed from structural-signature embeddings · 2026-10-25