Evolutionary programming

You don't need to be Editor-In-Chief to add or edit content to WikiDoc. You can begin to add to or edit text on this WikiDoc page by clicking on the edit button at the top of this page. Next enter or edit the information that you would like to appear here. Once you are done editing, scroll down and click the Save page button at the bottom of the page.

Evolutionary programming is one of the four major evolutionary algorithm paradigms.

It was first used by Lawrence J. Fogel in 1960 in order to use simulated evolution as a learning process aiming to generate artificial intelligence. Fogel used finite state machines as predictors and evolved them.

Currently evolutionary programming is a wide evolutionary computing dialect with no fixed structure or (representation), in contrast with some of the other dialects. It is becoming harder to distinguish from evolutionary strategies. Some of its original variants are quite similar to the later genetic programming, except that the program structure is fixed and its numerical parameters are allowed to evolve.

Its main variation operator is mutation; members of the population are viewed as part of a specific species rather than members of the same species therefore each parent generates an offspring, using a (μ + μ) survivor selection.

References

• Fogel, L.J., Owens, A.J., Walsh, M.J. (1966), Artificial Intelligence through Simulated Evolution, John Wiley.
• Eiben, A.E., Smith, J.E. (2003), Introduction to Evolutionary Computing, Springer. ISBN 3-540-40184-9

See also

• Artificial intelligence
• Genetic algorithm
• Genetic programming
• Genetic operator

Template:Compu-sci-stubde:Evolutionäre Programmierungja:進化的プログラミング