The compact genetic algorithm

G.R. Harik

doi:10.1109/4235.797971

1999-01-01

694

PRE

G.R. Harik *

Fernando G. Lobo

David E. Goldberg

DOI：10.1109/4235.797971

原文链接

原文求助

摘要

En 中文

This paper introduces the compact genetic algorithm (cGA) which 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. The development of the compact GA is guided by a proper understanding of the role of the GA's parameters and operators. The paper clearly illustrates the mapping of the simple GA's parameters into those of an equivalent compact GA; Computer simulations compare both algorithms in terms of solution quality and speed. Finally, this work raises important questions about the use of information in a genetic algorithm, and its ramifications show us a direction that can lead to the design of more efficient GA's.

Keyword:

bit wise simulated crossover

genetic algorithms

population based incremental learning

probabilistic modeling

univariate marginal distribution algorithm