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

v2 · 2026-09-06 · History

Domain-specific #

1801

Origin domain

evolutionary computation

Subdomain

population based metaheuristics

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.

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) — more general patterns this builds on

• Evolutionary Algorithm is a kind of Algorithm Prime

  prime:algorithm is the proposed minimal parent by strict specialization.

Hierarchy paths (2) — routes to 2 parentless roots

• Evolutionary Algorithm → Algorithm → Function (Mapping)

Show alternative path (1)

Neighborhood in Abstraction Space

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

Family — Population Genetics & Selection (15 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-09-08