Skip to content

Evolutionary Computation

Evolutionary computation (EC) from computer science is a family of algorithms for global optimization inspired by biological evolution, and a subfield of computational intelligence and soft computing studying these algorithms.

Version
v1 · 2026-09-28 · History
Domain-specific #
9334
Domain group
Applied Sciences & Engineering
Origin domain
Computer Science & Software Engineering
Subdomains
Computational Intelligence, Evolutionary Algorithms → Computer Science & Software Engineering

Core Idea

Evolutionary Computation is treated here as the recurring computer science and information systems identity summarized by this source-grounded definition: Evolutionary computation (EC) from computer science is a family of algorithms for global optimization inspired by biological evolution, and a subfield of computational intelligence and soft computing studying these algorithms. Evolutionary computation (EC) from computer science is a family of algorithms for global optimization inspired by biological evolution, and a subfield of computational intelligence and soft computing studying these algorithms.

Scope of Application

  • History. Among other mutation methods, interactions between chromosomes were used to simulate the recombination of DNA between different organisms.

  • Evolutionary algorithms and biology. Genetic algorithms deliver methods to model biological systems and systems biology that are linked to the theory of dynamical systems, since they are used to predict the future states of the.

  • Documented setting. These biological functions serve as role models for the genetic operators - mutation, crossover, and selection - used in the EC procedures.

  • History. The concept of mimicking evolutionary processes to solve problems originates before the advent of computers, such as when Alan Turing proposed a method of genetic search in 1948 .

  • History. His P-type u-machines resemble a method for reinforcement learning, where pleasure and pain signals direct the machine to learn certain behaviors.

Clarity

A clear use of Evolutionary Computation names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is Evolutionary computation (EC) from computer science is a family of algorithms for global optimization inspired by biological evolution, and a subfield of computational intelligence and soft computing studying these algorithms.

Manages Complexity

Evolutionary Computation compresses multiple computer science and information systems details into a stable diagnostic relation. The source shows both the central mechanism—the earliest computational simulations of evolution using evolutionary algorithms and artificial life techniques were performed by Nils Aall Barricelli in 1953, with first results published in 1954.—and the practical consequence—this technique was first used by the two to successfully solve optimization problems in fluid dynamics.

Abstract Reasoning

  1. Type the carrier. Identify the computer science and information systems entities to which the claim applies.
  2. State the relation. Use the source-grounded identity: Evolutionary computation (EC) from computer science is a family of algorithms for global optimization inspired by biological evolution, and a subfield of computational intelligence and soft computing studying these algorithms.
  3. Check operation and conditions. By 1965, the calculations were performed wholly by machine.
  4. Demand recognition evidence.

Knowledge Transfer

Within the home domain. Knowledge about Evolutionary Computation transfers literally when a new case preserves the same carrier type, relation, and recognition test. Among other mutation methods, interactions between chromosomes were used to simulate the recombination of DNA between different organisms. Genetic algorithms deliver methods to model biological systems and systems biology that are linked to the theory of dynamical systems, since they are used to predict the future states of the system. Beyond the home domain. No canonical parent is asserted for Evolutionary Computation.

Neighborhood in Abstraction Space

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

Family — Unclustered & Miscellaneous (2551 abstractions)

Nearest neighbors

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