50 lines
1.3 KiB
Markdown
50 lines
1.3 KiB
Markdown
---
|
|
title: "Evolutionary programming"
|
|
chunk: 1/1
|
|
source: "https://en.wikipedia.org/wiki/Evolutionary_programming"
|
|
category: "reference"
|
|
tags: "science, encyclopedia"
|
|
date_saved: "2026-05-05T11:33:18.863515+00:00"
|
|
instance: "kb-cron"
|
|
---
|
|
|
|
Evolutionary programming is an evolutionary algorithm, where a share of new population is created by mutation of previous population without crossover. Evolutionary programming differs from evolution strategy ES(
|
|
|
|
|
|
|
|
μ
|
|
+
|
|
λ
|
|
|
|
|
|
{\displaystyle \mu +\lambda }
|
|
|
|
) in one detail. All individuals are selected for the new population, while in ES(
|
|
|
|
|
|
|
|
μ
|
|
+
|
|
λ
|
|
|
|
|
|
{\displaystyle \mu +\lambda }
|
|
|
|
), every individual has the same probability to be selected. It is one of the four major evolutionary algorithm paradigms.
|
|
|
|
|
|
== History ==
|
|
It was first used by Lawrence J. Fogel in the US in 1960 in order to use simulated evolution as a learning process aiming to generate artificial intelligence. It was used to evolve finite-state machines as predictors.
|
|
|
|
|
|
== See also ==
|
|
Genetic algorithm
|
|
Genetic operator
|
|
|
|
|
|
== References ==
|
|
|
|
|
|
== External links ==
|
|
The Hitch-Hiker's Guide to Evolutionary Computation: What's Evolutionary Programming (EP)?
|
|
Evolutionary Programming by Jason Brownlee (PhD) Archived 2013-01-18 at the Wayback Machine |