Scribd
Upload
11 views

CGA Assignment Adaptive System

This document describes an assignment on compact genetic algorithms. It explains that compact genetic algorithms are a type of estimation of distribution algorithm that extends evolutionary computation. It then provides an example of running two iterations of a compact genetic algorithm on a problem with a population size of 2, a chromosome length of 16, and an initial primary probability vector. It generates chromosomes for each iteration based on the probability vector, calculates their fitness, and updates the probability vector based on the fitnesses.

Uploaded by

Moin Uddin
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

CGA Assignment Adaptive System

This document describes an assignment on compact genetic algorithms. It explains that compact genetic algorithms are a type of estimation of distribution algorithm that extends evolutionary computation. It then provides an example of running two iterations of a compact genetic algorithm on a problem with a population size of 2, a chromosome length of 16, and an initial primary probability vector. It generates chromosomes for each iteration based on the probability vector, calculates their fitness, and updates the probability vector based on the fitnesses.

Uploaded by

Moin Uddin
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment on Compact Genetic Algorithm

For the course CSE 533 Adaptive System

Submitted by Moin Uddin


2012-1-96-005

Compact Genetic Algorithm


The Compact Genetic Algorithm is an Estimation of Distribution Algorithm (EDA), also referred to as Population Model-Building Genetic Algorithms (PMBGA), an extension to the field of Evolutionary Computation.

Compact GA parameters: Population size, n=2 Chromosome length, l=16 Primary probability vector, p= {0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5} 1st Iteration: Now, we will generate chromosomes for A and B, based on probability factor p. a chromosomes probability for being 1 is 0.5 as for each i=0 to 15 probability is 0.5. A = {1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0} B = {1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1} Calculating fitness based on highest number of 1: fA = 8 fB = 6 Updating probability vector based on fitness of A and B. P = {0.5, 0.5, 0, 1, 1, 0.5, 0.5, 1, 0.5, 1, 0.5, 0.5, 0.5, 0.5, 0.5, 0} 2nd Iteration: A = {0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0} B = {1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0} Calculating fitness of A and B: fA = 8 fB = 10 Updating probability vector: P = {1, 0, 0.5, 0.5, 0.5, 1, 0, 0.5, 1, 0.5, 1, 0, 1, 0, 1, 0.5}

You might also like