Sketch of Simple Program Genetic Algorithm

For almost 3 weeks I have been learning about Genetic Algorithm (GA), especially NSGA-2. So, I write this posting to help me to understand a little bit about GA. I found a good reference for beginners who learn about GA. A David A. Coley book, An Introduction to Genetic Algorithms for Scientists and Engineers. 

This is just a sketch of the program, not a real code.

Generation = 1
Create initial population   /* Build a population of strings at random */
Find unknown                 /* Decode the new population to integers then real numbers */
Find fitness                      /* Find the fitness of each member of population */

FOR Generation = 2 TO maximum number of generations

FOR NewIndividual = 1 to PopulationSize STEP 2 /* Loop over the population choosing pairs of mates */
           Select a mate
           Select other mate
           Perform Crossover      /* Pass individuals to the temporary population */

NEXT NewIndividual

Perform Mutate   /* Mutate the temporary population */
Replace               /* Replace the old population by the new one */
Find unknowns   /* Decode the new population to integers then real numbers */
Find fitness         /* Find the fitness of each member of population */

NEXT Generation

Advertisements

3 Responses to “Sketch of Simple Program Genetic Algorithm”

  1. mudrikalaydrus Says:

    anyiiiiiiiiiiiiiip… apa kabar …
    en ce moment je suis à Munich à la mi-Décembre

    Like

  2. mudrikalaydrus Says:

    ha.ha..ha.. iya.. di google map satu garis horizontal tuh …

    Like

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s


%d bloggers like this: