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. In technical terms, they are a family of population-based trial and error problem solvers with a metaheuristic or stochastic optimization character. In evolutionary computation, an initial set of candidate solutions is generated and iteratively updated.

Each new generation is produced by stochastically removing less desired solutions, and introducing small random changes as well as, depending on the method, mixing parental information. In biological terminology, a population of solutions is subjected to natural selection (or artificial selection), mutation and possibly recombination. These biological functions serve as role models for the genetic operators - mutation, crossover, and selection - used in the EC procedures.

For Evolutionary Computation, the abstraction is narrower than the article's general subject matter: a positive case must preserve 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. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in computer science and information systems, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — Populations of chromosomes, represented as bit strings, were transformed by an artificial selection process, selecting for specific 'allele' bits in the bit string.
Constitutive relation — 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.
Operating condition — By 1965, the calculations were performed wholly by machine.
Recognition evidence — 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 .
Admissible variation — There were several independent attempts to use the process of evolution in computing at this time, which developed separately for roughly 15 years.
Characteristic consequence — This technique was first used by the two to successfully solve optimization problems in fluid dynamics.
Failure boundary — Initially, this optimization technique was performed without computers, instead relying on dice to determine random mutations.

What It Is Not¶

Not the whole field of computer science and information systems. The node requires the specific identity stated by 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.
Not an over-broad reading. However, Turing's paper went unpublished until 1968, and he died in 1954, so this early work had little to no effect on the field of evolutionary computation that was to develop.
Not an over-broad reading. Three branches emerged in different places to attain this goal: evolution strategies, evolutionary programming, and genetic algorithms.
Not an over-broad reading. Among other mutation methods, interactions between chromosomes were used to simulate the recombination of DNA between different organisms.
Not automatically Evolutionary Algorithm. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Evolutionary Computation applies literally inside computer science and information systems wherever the source-defined carrier and relation can be established. Its documented habitats include:

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 system.
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.
History. These approaches differ in the method of selection, the permitted mutations, and the representation of genetic data.

Outside computer science and information systems, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Theory or should be marked as analogy.

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. The strongest recognition evidence in the frozen account is: 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 . A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification However, Turing's paper went unpublished until 1968, and he died in 1954, so this early work had little to no effect on the field of evolutionary computation that was to develop. so that a reader can reproduce the classification rather than infer it from topical resemblance.

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. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the computer science and information systems entities to which the claim applies.
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.
Check operation and conditions. By 1965, the calculations were performed wholly by machine.
Demand recognition evidence. 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 .
Test variation. Change an implementation or setting while preserving there were several independent attempts to use the process of evolution in computing at this time, which developed separately for roughly 15 years.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Theory.

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. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

Evolutionary finite automata, the simplest subclass of Evolutionary automata working in terminal mode can accept arbitrary languages over a given alphabet, including non-recursively enumerable (e.g., diagonalization language) and recursively enumerable but not recursive languages (e.g., language of the universal Turing machine). This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → 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; recognition evidence → 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

Applied / In Practice¶

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 . The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → History; invariant → 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; boundary → the case exits the class when however, Turing's paper went unpublished until 1968, and he died in 1954, so this early work had little to no effect on the field of evolutionary computation that was to develop

Structural Tensions¶

T1 — Stable identity versus admissible variation. However, Turing's paper went unpublished until 1968, and he died in 1954, so this early work had little to no effect on the field of evolutionary computation that was to develop. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. Three branches emerged in different places to attain this goal: evolution strategies, evolutionary programming, and genetic algorithms. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. Among other mutation methods, interactions between chromosomes were used to simulate the recombination of DNA between different organisms. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. Many other figures played a role in the history of evolutionary computing, although their work did not always fit into one of the major historical branches of the field. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. Populations of chromosomes, represented as bit strings, were transformed by an artificial selection process, selecting for specific 'allele' bits in the bit string. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Evolutionary Computation literally, co-instantiate Theory, or only resemble it?

T6 — Autonomy versus reduction. 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. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Evolutionary Computation distinguish that the broader parent Theory leaves together?

Structural–Framed Character¶

Evolutionary Computation is structural-leaning. Its structural side is the repeatable organization summarized by 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. Its framed side is the computer science and information systems vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: By 1965, the calculations were performed wholly by machine. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Theory. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. 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. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: Populations of chromosomes, represented as bit strings, were transformed by an artificial selection process, selecting for specific 'allele' bits in the bit string. 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. It further constrains recognition and variation through: By 1965, the calculations were performed wholly by machine. 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 .

What is domain-bound. computer science and information systems supplies the operative entities, technical vocabulary, warrants, and exceptions that make Evolutionary Computation literal. Its documented scope includes the condition that Among other mutation methods, interactions between chromosomes were used to simulate the recombination of DNA between different organisms. Another bounded application condition is that 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. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—There were several independent attempts to use the process of evolution in computing at this time, which developed separately for roughly 15 years.—and future graph densification may discover a defensible relation only if it preserves that boundary.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Evolutionary Computation. The reviewed identity 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. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Neighborhood in Abstraction Space¶

Evolutionary Computation 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 — Unclustered & Miscellaneous (2551 abstractions)

Nearest neighbors

DNA computing — 0.83
Mosaic evolution — 0.82
Selection in Evolutionary Algorithms — 0.82
Metropolis Algorithm — 0.81
Numerical taxonomy — 0.81

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

Not to Be Confused With¶

Theory. The parent omits the specialist differentia. Tell: Can the case establish 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 Algorithm. A population-based stochastic search family that repeatedly evaluates encoded candidates, selects parents or survivors, creates heritable variants, and replaces population members. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Evolutionary data mining. A family of data-mining methods that use evolutionary search to evolve rules, feature sets, model structures, parameters, or pipelines under a data-dependent fitness function. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Population-based incremental learning. An estimation-of-distribution optimizer that evolves a probability vector summarizing successful sampled solutions instead of maintaining genetic individuals across generations. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Evolutionary Computation remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside computer science and information systems lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Theory?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Evolutionary_computation (revision 1356409705).
Preserved source candidate: https://www.springer.com/in/book/9783540201670
Preserved source candidate: https://github.com/fcampelo/EC-Bestiary
Preserved source candidate: https://zenodo.org/record/1293035
Preserved source candidate: https://www.nature.com/articles/s42256-022-00579-0
Preserved source candidate: https://plato.stanford.edu/entries/information-biological/#InfEvo
Preserved source candidate: https://www.amazon.com/Handbook-Evolutionary-Computation-Thomas-Back/dp/0750303921
Preserved source candidate: http://caribou.iisg.agh.edu.pl/pub/svn/age/jage/legacy/papers/mgrKA/pdf/evco.1993.1.1.pdf
Preserved source candidate: https://web.archive.org/web/20180712174303/http://caribou.iisg.agh.edu.pl/pub/svn/age/jage/legacy/papers/mgrKA/pdf/evco.1993.1.1.pdf

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.