A Step Forward in Studying the Compact Genetic Algorithm

Details A Step Forward in Studying the Compact Genetic Algorithm A Step Forward in Studying the Compact Genetic Algorithm

2009-01-06

arxiv.org/abs/0901.0598v1

Evolutionary Computation (2006),Vol 14, No 3, 277-290

Computer Science

Neural and Evolutionary Computing

13 Pages

Scientific paper

The compact Genetic Algorithm (cGA) is an Estimation of Distribution Algorithm that generates offspring population according to the estimated probabilistic model of the parent population instead of using traditional recombination and mutation operators. The cGA only needs a small amount of memory; therefore, it may be quite useful in memory-constrained applications. This paper introduces a theoretical framework for studying the cGA from the convergence point of view in which, we model the cGA by a Markov process and approximate its behavior using an Ordinary Differential Equation (ODE). Then, we prove that the corresponding ODE converges to local optima and stays there. Consequently, we conclude that the cGA will converge to the local optima of the function to be optimized.

Affiliated with

Also associated with

No associations

Rating

A Step Forward in Studying the Compact Genetic Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Step Forward in Studying the Compact Genetic Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Step Forward in Studying the Compact Genetic Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-631917