Crossover can provably be useful in evolutionary computation (Q418021)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Crossover can provably be useful in evolutionary computation |
scientific article; zbMATH DE number 6034867
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Crossover can provably be useful in evolutionary computation |
scientific article; zbMATH DE number 6034867 |
Statements
Crossover can provably be useful in evolutionary computation (English)
0 references
14 May 2012
0 references
The authors try to prove that the use of the crossover operator in evolutionary computation is beneficial. They use the all-pairs shortest (APSP) problem to prove that the use of crossover made a natural evolutionary algorithm significantly faster. Under these circumstances, it seems that this is the first non-artificial approach to answer the question: ``How important is the crossover in evolutionary computation?''
0 references
evolutionary computation
0 references
crossover
0 references
mutation
0 references
all-pairs shortest path (APSP) problem
0 references
