The compact genetic algorithm

The compact genetic algorithm

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 an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Harik, G.R., Lobo, F.G., Goldberg, D.E.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithm design and analysis
Computer simulation
Evolutionary computation
Genetic algorithms
Genetic engineering
Graphics
Helium
History
Mathematical model
Probability distribution
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/ICEC.1998.700083