Evolutionary Algorithms

Technique

Evolutionary Algorithms (EAs) are a class of search and optimization techniques inspired by biological evolution, applied across software engineering, automated theorem proving, and embedded systems design. They evolve candidate solutions through selection, variation, and evaluation, and are noted for flexibility and versatility, though typically requiring many solution evaluations to converge.

First seen 6/27/2026

Last seen 6/27/2026

Evidence 1 chunks

Wiki v1

WIKI

Overview

Evolutionary Algorithms (EAs) are a family of population-based metaheuristic optimization methods that draw inspiration from mechanisms of biological evolution, such as selection, mutation, recombination, and fitness-based survival. They have been applied to a wide variety of scientific and engineering problems across numerous disciplines over several decades, and are widely recognized for their flexibility and versatility.

Characteristics

READ FULL ARTICLE →

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

2 connections

proGenesys: Program Generation Tool Based on Genetic Systems ← mentions 80% 1e

Listed among the paper's topics, indicating the work discusses evolutionary algorithms.

proGenesys ← uses 55% 1e

The tool is described as based on genetic systems; genetic systems are a class within evolutionary computation, aligning with the paper's topic of evolutionary algorithms.

LINKED ENTITIES

2 links

proGenesys: Program Generation Tool Based on Genetic Systems MENTIONS Extracted graph relationship

proGenesys USES Extracted graph relationship

CITATIONS

6 sources

6 citations — click to expand

[1] Evolutionary algorithms are flexible, versatile, and have been applied to a wide variety of scientific and engineering problems across numerous disciplines for several decades. Automatically Proving Mathematical Theorems with Evolutionary Algorithms and Proof Assistants

[2] Evolutionary algorithms typically require a large number of solution evaluations to converge, which can be slow and expensive. Beyond Evolutionary Algorithms for Search-based Software Engineering

[3] By building a very large initial population and culling with recursive bi-clustering, comparable results to state-of-the-art EAs can be achieved with under 100 evaluations on multiple SE models (unconstrained and constrained). Beyond Evolutionary Algorithms for Search-based Software Engineering

[4] Evolutionary algorithms have been used as program generators to automatically construct formal proofs, with proof assistants (e.g., Coq) acting as verifiers, based on the Curry–Howard correspondence between proofs and programs. Automatically Proving Mathematical Theorems with Evolutionary Algorithms and Proof Assistants

[5] Ten simple theorems from various branches of mathematics were proved using an EA + proof-assistant approach, most of which could not be proved using Coq's `auto` tactic alone. Automatically Proving Mathematical Theorems with Evolutionary Algorithms and Proof Assistants

[6] The proGenesys tool applies genetic-systems-based (evolutionary algorithm) program generation, with applications in embedded systems design, as described by Vili Podgorelec at the 1999 International Conference on Artificial Intelligence. proGenesys-Program Generation Tool Based on Genetic Systems