Jump to content

Evolutionary computation: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
m
No edit summary
Line 6: Line 6:




This mostly involves [[metaheuristic]] methods such as:
This mostly involves [[metaheuristic]] [[optimization (computer science)|optimization]] such as:
*[[evolutionary algorithm]]s - e.g. [[genetic algorithm]], [[genetic programming]], [[evolutionary programming]], [[evolution strategy]]
*[[evolutionary algorithm]]s - e.g. [[genetic algorithm]], [[genetic programming]], [[evolutionary programming]], [[evolution strategy]]
*[[swarm intelligence]] - e.g. [[ant colony optimization]], [[particle swarm optimization]]
*[[swarm intelligence]] - e.g. [[ant colony optimization]], [[particle swarm optimization]]

Revision as of 10:21, 16 October 2005

In computer science evolutionary computation denotes a subfield of artificial intelligence (more particular computational intelligence) involving combinatorial optimization problems. Whereas evolutionary algorithms generally only include methods such as natural reproduction, mutation, recombination and survival of the fittest, evolutionary computation is loosely recognised by the following criteria:


This mostly involves metaheuristic optimization such as:

and in a lesser extent also:

References

  • IEEE Transactions on Evolutionary Computing[2]
  • Evolutionary Computation Repository[3]