DocumentCode
2974044
Title
The compact genetic algorithm
Author
Harik, Georges R. ; Lobo, Fernando G. ; Goldberg, David E.
Author_Institution
Silicon Graphics Comput. Syst., Mountain View, CA, USA
fYear
1998
fDate
4-9 May 1998
Firstpage
523
Lastpage
528
Abstract
This paper introduces the “compact genetic algorithm” (cGA). The cGA represents the population as a probability distribution over the set of solutions, and is operationally equivalent to the order-one behavior of the simple GA with uniform crossover. It processes each gene independently and requires less memory than the simple GA
Keywords
genetic algorithms; probability; compact genetic algorithm; independent gene processing; memory requirement; order-one behavior; population representation; probability distribution; solution set; uniform crossover; Algorithm design and analysis; Computer simulation; Evolutionary computation; Genetic algorithms; Genetic engineering; Graphics; Helium; History; Mathematical model; Probability distribution;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on
Conference_Location
Anchorage, AK
Print_ISBN
0-7803-4869-9
Type
conf
DOI
10.1109/ICEC.1998.700083
Filename
700083
Link To Document