DMCA
Genetic Algorithms With Multi-Parent Recombination (1994)
| Citations: | 78 - 4 self |
BibTeX
@MISC{Eiben94geneticalgorithms,
author = {A.E. Eiben and P-E. Raué and Zs. Ruttkay},
title = {Genetic Algorithms With Multi-Parent Recombination},
year = {1994}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we investigate genetic algorithms where more than two parents are involved in the recombination operation. In particular, we introduce gene scanning as a reproduction mechanism that generalizes classical crossovers, such as n-point crossover or uniform crossover, and is applicable to an arbitrary number (two or more) of parents. We performed extensive tests for optimizing numerical functions, the TSP and graph coloring to observe the effect of different numbers of parents. The experiments show that 2-parent recombination is outperformed when using more parents on the classical DeJong functions. For the other problems the results are not conclusive, in some cases 2 parents are optimal, while in some others more parents are better. 1. Introduction A fact in nature is that the creation of new individuals always occurs through either asexual (one parent) or sexual (two parents) reproduction. It hardly ever puzzles people why the number of parents is restricted to one or two....
Keyphrases
genetic algorithm multi-parent recombination recombination operation arbitrary number extensive test classical dejong function 2-parent recombination gene scanning different number new individual graph coloring uniform crossover n-point crossover numerical function reproduction mechanism classical crossover
