Introduction to genetic algorithms with Java applets

More documents

Recommendations

Info

Other resourcesAppendix: Other ResourcesAt this page are some selected links to web sites or ftps, where you can find more information aboutgenetic algorithms and concerning stuff.ENCORE, the EvolutioNary COmputation REpository networkftp://alife.santafe.edu/pub/USER-AREA/EC/ (there are also some others nodes)FAQ - The Hitch-Hiker's Guide to Evolutionary Computationftp://alife.santafe.edu/pub/USER-AREA/EC/FAQ/www/index.htmlFAQ - Genetic programminghttp://www-dept.cs.ucl.ac.uk/research/genprog/gp2faq/gp2faq.htmlThe Genetic Algorithms Archive - many links, information about mailing list, some fun stuffhttp://www.aic.nrl.navy.mil:80/galist/Artificial Life Online - links, if you are looking for some introductory materials, look herehttp://alife.santafe.edu/Yahoo! Science:Computer Science:Algorithms:Genetic Algorithms - directory of other linkshttp://www.yahoo.com/Science/Computer_Science/Algorithms/Genetic_Algorithms/Usenet groups comp.ai.genetic and comp.ai.alifeNote: All links were checked at the time of creating. If you find any broken link, please inform me.(c) Marek Obitko, 1998http://cs.felk.cvut.cz/~xobitko/ga/resources.html [7.5.2000 16:33:07]
RecommendationsXIII. RecommendationsParameters of GAThis chapter should give you some basic recommendations if you have decided to implement yourgenetic algorithm. These recommendations are very general. Probably you will want to experiment withyour own GA for specific problem, because today there is no general theory which would describeparameters of GA for any problem.Recommendations are often results of some empiric studies of GAs, which were often performed only onbinary encoding.● Crossover rateCrossover rate generally should be high, about 80%-95%. (However some results show that forsome problems crossover rate about 60% is the best.)● Mutation rateOn the other side, mutation rate should be very low. Best rates reported are about 0.5%-1%.● Population sizeIt may be surprising, that very big population size usually does not improve performance of GA (inmeaning of speed of finding solution). Good population size is about 20-30, however sometimessizes 50-100 are reported as best. Some research also shows, that best population size depends onencoding, on size of encoded string. It means, if you have chromosome with 32 bits, thepopulation should be say 32, but surely two times more than the best population size forchromosome with 16 bits.● SelectionBasic roulette wheel selection can be used, but sometimes rank selection can be better. Checkchapter about selection for advantages and disadvantages. There are also some more sophisticatedmethod, which changes parameters of selection during run of GA. Basically they behaves likesimulated annealing. But surely elitism should be used (if you do not use other method for savingthe best found solution). You can also try steady state selection.● EncodingEncoding depends on the problem and also on the size of instance of the problem. Check chapterabout encoding for some suggestions or look to other resources.● Crossover and mutation typeOperators depend on encoding and on the problem. Check chapter about operators for somesuggestions. You can also check other sites.http://cs.felk.cvut.cz/~xobitko/ga/recom.html (1 of 2) [7.5.2000 16:33:07]
Page 2 and 3: About DNADNA (Deoxyribonucleic acid
Page 4 and 5: About DNA(c) Marek Obitko, 1998http
Page 6 and 7: IntroductionI. IntroductionFirst Wo
Page 8 and 9: Search Spaceresearchers (and maybe
Page 10 and 11: Main pageGENETICALGORITHMSThese pag
Page 12 and 13: Genetic algorithm4.5.6.2. [Crossove
Page 16 and 17: RecommendationsApplications of GAGe
Page 18 and 19: Operators of GAThere are other ways
Page 20 and 21: Parameters of GAVII. Parameters of
Page 22 and 23: GA - 3D functionVIII. Extreme of Fu
Page 24 and 25: SelectionRank SelectionThe previous
Page 26 and 27: EncodingX. EncodingIntroductionEnco
Page 28 and 29: EncodingTree EncodingTree encoding
Page 30 and 31: Crossover and mutation11001011 + 11
Page 32 and 33: TSP ExampleXII. Travelling Salesman
Page 34 and 35: Frequently asked questionsFAQ - Fre
Page 36: Access statisticsAccess statistics

Introduction to genetic algorithms with Java applets

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?