DocumentCode :
1869879
Title :
Multiple Crossover Per Couple in genetic algorithms
Author :
Esquivel, S.C. ; Leiva, A.
Author_Institution :
Grupo de Interes en Sistemas de Comput., Univ. Nacional de San Luis
fYear :
1997
fDate :
13-16 Apr 1997
Firstpage :
103
Lastpage :
106
Abstract :
Conventional approaches to crossover apply the operator only once on the selected pair of parents, to create precisely two offspring. Multiple Crossover Per Couple (MCPC) is an alternative, recently proposed (S. Esquivel et al., 1995), approach under which more than one crossover operation for each mating pair is allowed. The paper shows the empirical results obtained with genetic algorithms allowing MCPC when searching for minimum global values for a set of hard functions
Keywords :
genetic algorithms; genetics; search problems; Multiple Crossover Per Couple; crossover operation; genetic algorithms; hard functions; mating pair; minimum global values; searching; Algorithm design and analysis; Biological cells; Councils; Genetic algorithms; Genetic mutations; Proposals; Size control; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 1997., IEEE International Conference on
Conference_Location :
Indianapolis, IN
Print_ISBN :
0-7803-3949-5
Type :
conf
DOI :
10.1109/ICEC.1997.592277
Filename :
592277
Link To Document :
بازگشت