[galib] Deme GA

[Camilo Gomez]

Has anyone used GAdeme with different parameters for the ga for each
population?

Say I want 3 populations of the same size but the following parameters:
1) pMut=0.01
   pCross =1
2) pMut = 0.05
   pCross = 0.95
3) pMut = 0.2
   pCross = 0.8

What I want to do is protect the master population (the one that has the
best individuals of all) from a high mutation probability. I want to
increase this mutation probability because my search space is huge and I
always want to keep searching areas of my search space. To do so, I
increase the mutation probability but this high mutation rate messes up
good candidates if this pMut is applied to all the elements in my
population. Then the GA will have a really hard time converging to an
optimum point. 

But if I isolate these mutation probabilities in different populations I
can keep the best candidates migrating from one population to the next.
I want to do this because I do not like elitism so instead I want the
best say because they migrate to a better place instead of just being
picked!

Any ideas on how to do this?
Do you think that this method can get a higher performance than a
SimpleGA with elitism?

 
Camilo Gómez
 
 
"About 60 million transistors were built this year just for you, with
another 60 million for each of your friends, plus 60 million for every
other man, woman, and child on Earth. By 2010, the number should be
around one billion transistors per person per year. "
 
http://www.embedded.com/story/OEG20021217S0039

-----Original Message-----
From: galib-bounces at mit.edu [mailto:galib-bounces at mit.edu] On Behalf Of
he zheng
Sent: Monday, May 31, 2004 1:20 AM
To: camgomez63 at hotmail.com
Cc: galib at mit.edu
Subject: RE: [galib] a problem in galib and a question about convergence

Canmilo:
Thanks for your reply.
I believe i can get a better solution if I run longer.but how many 
generations can i get a better solution ?maybe after 5000 generations,i
can 
get a solution ,and if i try to run more generations ,can i get a better
one 
? I think there must be some rule just like below:
if the program can not find a better solution in 1500(or more) 
generations,we stop running.
but in galib ,none of three termination conditions can do that things.
can you tell me how to evalution the convergence ?
Thank you!


                          Ethen





>From: "Camilo Gomez" <camgomez63 at hotmail.com>
>To: "'he zheng'" <hezheng at hotmail.com>,<galib at mit.edu>
>Subject: RE: [galib] a problem in galib and a question about
convergence
>Date: Sun, 30 May 2004 22:18:38 -0600
>
>
>I am not sure if it is a problem with the library. It may be just that
>when you use termination upon generation you have more chances to get a
>better solution than when you terminate by convergence because you run
>longer.
>
>Camilo Gómez
>
>
>"About 60 million transistors were built this year just for you, with
>another 60 million for each of your friends, plus 60 million for every
>other man, woman, and child on Earth. By 2010, the number should be
>around one billion transistors per person per year. "
>
>http://www.embedded.com/story/OEG20021217S0039
>
>-----Original Message-----
>From: galib-bounces at mit.edu [mailto:galib-bounces at mit.edu] On Behalf Of
>he zheng
>Sent: Thursday, May 27, 2004 2:19 AM
>To: galib at mit.edu
>Subject: [galib] a problem in galib and a question about convergence
>
>Hi!
>I am now using galib to solve combinational optimization
>question.because
>this  questions is a NP-Complete question,So I can not know whether the
>final result is the nearest one to the optimization result. I  use some
>methods as below:
>1.i use GAGeneticAlgorithm::TerminateUponConvergence as the end
>condition,and set pConvergence = 0.99. but i found a problem in galib
>,when
>i set ga.minimize(),i can not get a convergence less than 1 during
>calculation.
>2.when i set pConvergence = 1,then i can get a result.first i regard it
>as
>the optimization one,but when i use
>GAGeneticAlgorithm::TerminateUponGeneration as ending condition ,and
>then i
>get a result which is much better than the first result.it shows when i
>use
>GAGeneticAlgorithm::TerminateUponConvergence ,i can not get the best
>result.but when i use GAGeneticAlgorithm::TerminateUponGeneration,it
>will
>take more time to do calculation.
>
>Can anybody kind enough to give me some advise,thanks .
>
>
>                                     Ethen
>
>_________________________________________________________________
>Tired of spam? Get advanced junk mail protection with MSN 8.
>http://join.msn.com/?page=features/junkmail
>
>_______________________________________________
>galib mailing list
>galib at mit.edu
>http://mailman.mit.edu/mailman/listinfo/galib

_________________________________________________________________
Tired of spam? Get advanced junk mail protection with MSN 8. 
http://join.msn.com/?page=features/junkmail

_______________________________________________
galib mailing list
galib at mit.edu
http://mailman.mit.edu/mailman/listinfo/galib