## Algorithms

Moderators: None (Apply to moderate this forum)
Number of posts: 786

This Forum Only

NetLogo_GeneticProgramming Posted by Salesman on 19 Jan 2012 at 1:50 AM
Hi all, I'm trying to figure out how does the genetic algorithm works? I don't understand what does random-seed in the program means? Is it number? A constant? If it is, why do we need it?
This is the program I'm talking about ->
http://www.cs.northwestern.edu/~fjs750/netlogo/final/gpdemo.html
Re: NetLogo_GeneticProgramming Posted by Agniv on 10 Nov 2012 at 12:42 PM
I understand I am replying very late and I am not quite sure if the answer to your question is still relevant to you...

the 'random seed' in this example given by you indicates a random value/path with which the turtle starts to move. In genetic algorithm, sometimes a random value is inserted to take the search process out of local minima. It may also help to speed up the search.

To my understanding, this example uses a random seed only in the first step. However, the results are clear. On one particular case with random seed 'on', I got convergence in 20 steps. The same search took 250 generations with the same population size (9).

It is simply a random path that can be anywhere on the map. The subsequent chromosomes are derived from this chromosome. The exact process depends upon the value of 'clone-chance', 'mutate-chance' and 'crossover-chance'.

On a different note, if you are trying to learn GA from basics, IMHO... it is better not to use any libraries initially. Use C/C++/Java/Perl etc. and code it from scratch.

Re: NetLogo_GeneticProgramming Posted by Agniv on 10 Nov 2012 at 12:47 PM
I understand I am replying very late and I am not quite sure if the answer to your question is still relevant to you...

the 'random seed' in this example given by you indicates a random value/path with which the turtle starts to move. In genetic algorithm, sometimes a random value is inserted to take the search process out of local minima. It may also help to speed up the search.

To my understanding, this example uses a random seed only in the first step. However, the results are clear. On one particular case with random seed 'on', I got convergence in 20 steps. The same search took 250 generations with the same population size (9).

It is simply a random path that can be anywhere on the map. The subsequent chromosomes are derived from this chromosome. The exact process depends upon the value of 'clone-chance', 'mutate-chance' and 'crossover-chance'.

On a different note, if you are trying to learn GA from basics, IMHO... it is better not to use any libraries initially. Use C/C++/Java/Perl etc. and code it from scratch.

## Recent Jobs

Official Programmer's Heaven Blogs
Web Hosting | Browser and Social Games | Gadgets

Popular resources on Programmersheaven.com
Assembly | Basic | C | C# | C++ | Delphi | Flash | Java | JavaScript | Pascal | Perl | PHP | Python | Ruby | Visual Basic