DocumentCode
1651123
Title
Real-coded evolutionary algorithms with parent-centric recombination
Author
Deb, Kalyanmoy ; Joshi, Dhiraj ; Anand, Ashish
Author_Institution
Kanpur Genetic Algorithms Lab., Indian Inst. of Technol., Kanpur, India
Volume
1
fYear
2002
Firstpage
61
Lastpage
66
Abstract
Due to an increasing interest in solving real-world optimization problems using evolutionary algorithms (EAs), researchers have developed a number of real-parameter genetic algorithms (GAs) in the recent past. In such studies, the main research effort is spent on developing an efficient recombination operator. Such recombination operators use probability distributions around the parent solutions to create offspring. Some operators emphasize solutions at the center of mass of parents and some around the parents. We propose a generic parent-centric recombination operator (PCX) and compare its performance with a couple of commonly-used mean-centric recombination operators (UNDX and SPX). With the help of a steady-state, elite-preserving, and computationally fast EA model, simulation results show the superiority of PCX on three test problems
Keywords
genetic algorithms; probability; elite-preserving model; generic parent-centric recombination operator; mean-centric recombination operators; performance; probability distributions; real-coded evolutionary algorithms; real-parameter genetic algorithms; real-world optimization problems; recombination operator; simulation; steady-state model; Computational modeling; Evolutionary computation; Gaussian distribution; Genetic algorithms; Laboratories; Parametric study; Probability distribution; Springs; Surges; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on
Conference_Location
Honolulu, HI
Print_ISBN
0-7803-7282-4
Type
conf
DOI
10.1109/CEC.2002.1006210
Filename
1006210
Link To Document