1 / 39

Genetic Algorithms

? why not change the world?. Gen(0), fitness = 6.0, INT:1, -1, 1, 1, -1, 2, 0, 0, 1, -1, 2, 2, 2, 1, 0, 0, 1, 2, -1, 2, 2, -1, 2, 1, 0, 2, 1, -1, 0, -1, 0, -1, 1, 2, 0, 1, 1, -1, 1, 0

yehuda
Download Presentation

Genetic Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. ? why not change the world? Gen(0), fitness = 6.0, INT:1, -1, 1, 1, -1, 2, 0, 0, 1, -1, 2, 2, 2, 1, 0, 0, 1, 2, -1, 2, 2, -1, 2, 1, 0, 2, 1, -1, 0, -1, 0, -1, 1, 2, 0, 1, 1, -1, 1, 0 Gen(1), fitness = 8.0, INT:1, -1, 1, 1, -1, 2, -1, 0, 0, 1, 2, 1, 0, 2, 0, 0, 1, 2, -1, 2, 2, -1, 2, 1, 0, 2, 1, -1, 0, -1, 0, -1, 1, 2, 0, 1, 1, -1, 1, 0 Gen(2), fitness = 8.0, INT:1, -1, 1, 1, -1, 2, -1, 0, 0, 1, 2, 1, 0, 2, 0, 0, 1, 2, -1, 2, 2, -1, 2, 1, 0, 2, 1, -1, 0, -1, 0, -1, 1, 2, 0, 1, 1, -1, -1, 2 Gen(3), fitness = 9.0, INT:1, -1, 1, 1, -1, 2, -1, 0, 0, 1, 2, 1, 0, 2, 0, 0, 1, 2, -1, 2, 2, -1, 2, 1, 0, 2, 1, -1, 2, -1, 2, 0, 1, 1, -1, 1, -1, 0, 0, 2 Gen(4), fitness = 9.0, INT:1, -1, 1, 1, -1, 2, -1, 0, 0, 1, 2, 1, 0, 2, 0, 0, 1, 2, -1, 2, 2, -1, 2, 1, 0, 2, 1, -1, 0, -1, 0, -1, 1, 0, -1, 1, 2, 0, 0, 1 Genetic Algorithms Sample Applications Tom Kiehl kiehlt@rpi.edu

  2. Sample Applications • Crypto (quote) • Satellite Scheduling • Combinatorial Chemistry • Biological Interaction Networks • Financial Pattern Detection

  3. General Approach • Each unique application of the GA may require special treatment of one or more of the particular components of the GA, or steps in the GA process. • Your goal is to provide the GA with information about the problem at hand. [encoding][fitness][selection][population][mutation][recombination]

  4. CryptoQuote • A CryptoQuote is a simple substitution code where each letter that appears may stand for a different letter. • The substitutions are consistent throughout the puzzle. Punctuation is not translated. • For example: POLYYONTOP = RENSSELAER • Thoughts? [encoding][fitness][selection][population][mutation][recombination]

  5. CryptoQuoteencoding/representation • 26 different possible letters => 26 Integer Alleles • No two letters can convert to the same letter => 26 Unique allele values • The allele positions tell us what each letter must convert to. [encoding][fitness][selection][population][mutation][crossover]

  6. CryptoQuotefitness/objective • Plenty of Options: • Total Number of real words found in solution. • The GA had a tendency to solve the short words in the problem and leave larger words untouched. • For each real word, calculate the percentage • (lengthwise) of the entire string which this word represents. Sum all of the real words' percentages. • This fitness function worked somewhat better the previous one, but still provided little pressure to attain large words [encoding][fitness][selection][population][mutation][crossover]

  7. CryptoQuotefitness/objective • Even More Options: • A very complicated scheme in which each word in the solution contributes to the overall fitness based on how connected the word is to other words. This measure also took into account whether or not the GA had solved some of the words that the word was connected to. • We hard-coded some values for one particular problem and than ran just that one. It was obvious that the added value (almost nil) was not worth the programming effort to make this work. • Sum of the squares of the lengths of all of the real words. • Amazingly enough, this seems to work best, against all of our intuitions about how much information we were providing the GA. [encoding][fitness][selection][population][mutation][crossover]

  8. CryptoQuotefitness/objective • And Another Twist … • Extra points for single letter words. This was used in conjunction with the sum of squares method. • This accelerated the GA through some of the early stages of deciding what the single character words should be. Moved the population into a state where most had a's and i's in place for the single character words [encoding][fitness][selection][population][mutation][crossover]

  9. CryptoQuotefitness/objective: Role of the Dictionary • Tested with two different dictionaries • /usr/dict/words 25143 words • contained individual letters • contained abbreviations • contained common names • contained only root words (ed, s, ing missing) • an NL dictionary 104217 words • addressed the above problems and provided more words • Significantly better performance with NL dictionary [encoding][fitness][selection][population][mutation][crossover]

  10. CryptoQuotefitness/objective: Role of the Dictionary • Word Length Distributions were significantly different between the two dictionaries. • /usr/dict/words NL Dictionary [encoding][fitness][selection][population][mutation][crossover]

  11. CryptoQuoteselection • Worked great even with a uniformrandom selection mechanism. • We found that this problem was just filled with local maxima, so the random nature of the selection mechanism gave much better coverage of the search space and avoided premature convergence. [encoding][fitness][selection][population][mutation][crossover]

  12. CryptoQuotepopulation • Size/Generations: • We ran with a large population size of 400, which was necessary to maintain diversity. Much smaller when using speciation. • Initialization: • Each individual had to adhere to the constraints of the problem, having unique allele values. • Later we seeded the initial population with individuals which already had solutions for large words. This gave us a significant boost in performance [encoding][fitness][selection][population][mutation][crossover]

  13. CryptoQuotemutation • Swap Mutator • Maintained constraints • Causes a swap of values between two positions on the chromosome arabidopsis [encoding][fitness][selection][population][mutation][crossover]

  14. CryptoQuoterecombination/crossover • Partial Match Crossover • maintains constraints • Two random positions in the parent chromosomes are chosen. The chromosomes in the so determined interval are exchanged. Replace all doubled values outside the exchange interval by the following procedure: Look for the position p, where the value v is positioned in the other parent. Than replace v with the value which can be found at position p. [encoding][fitness][selection][population][mutation][crossover]

  15. CryptoQuotesample output • INPUT> Iuisbh supab wsxosib rt wsrwfs lar ens nbybunbuon fus. --Eizirli • Gen #50 Fitness:109 Best: • ** Biblty liwqt rlmclbt je rljrnl vqj xsl statistics nil. --Xbdbjvb • Gen #100 Fitness:145 Best: • ** Ninety eiwht leucent bv leblfe khb xse statistics fie. --Xndnbkn • Gen #150 Fitness:185 Best: • ** Ninety eifht percent mq pempxe jhm zse statistics xie. --Znknmjn • Gen #200 Fitness:194 Best: • ** Ninety eixvt percent wh pewple zvw qse statistics lie. --Qnbnwzn • Gen #250 Fitness:207 Best: • ** Ninety eimxt percent of peopde vxo use statistics die. --Unznovn • Gen #300 Fitness:230 Best: • ** Ninety eigft percent ov people qfo kse statistics lie. --Knhnoqn • Gen #350 Fitness:239 Best: • ** Ninety eizut percent ok people quo vse statistics lie. --Vnbnoqn • Gen #400 Fitness:243 Best: • ** Ninety eimzt percent oh people kzo use statistics lie. --Unxnokn • Gen #450 Fitness:255 Best: • ** Ninety eight percent ob people zho fse statistics lie. --Fnmnozn • Gen #1100 Fitness:301 Best: • ** Ninety eibht percent ox people who use statistics lie. --Unknown • Gen #1300 Fitness:326 Best: • ** Ninety eight percent of people who use statistics lie. --Unknown [encoding][fitness][selection][population][mutation][crossover]

  16. CryptoQuotesample output • INPUT> Xul eohp bp kpwnlip O'b n iwulagvpe. Mfpvp nvpa'm paulzf iwulagvpei oa xulv eoyp. -Fnvvoiua Yuvg, Mfp Pbcovp Imvohpi Knwh • Gen #50 Diversity:0.861545 Fitness:81 Convergence:1 Best: • ** Cob fkzs hs lsdibqs K'h i qdobrwesf. Muses iesr'm srobyu qdobrwesfq kr cobe fkgs. -Uieekqor Goew, Mus Shakes Qmekzsq Lidz • Gen #100 Diversity:0.813886 Fitness:102 Convergence:0.882353 Best: • ** Qkg rise de penagze I'd a znkguxmer. Theme ameu't eukgbh znkguxmerz iu qkgm rive. -Hammizku Vkmx, The Edwime Ztmisez Pans • Gen #150 Diversity:0.797175 Fitness:106 Convergence:1 Best: • ** Lam rots cs vszimks O'c i kzamxyesr. Buses iesx'b sxampu kzamxyesrk ox lame rows. -Uieeokax Waey, Bus Scqoes Kbeotsk Vizt • Gen #200 Diversity:0.797005 Fitness:122 Convergence:0.92623 Best: • ** Qfg kipe me zeyagse I'm a syfgndrek. There aren't enfglh syfgndreks in qfgr kibe. -Harrisfn Bfrd, The Emjire Stripes Zayp • Gen #300 Diversity:0.779562 Fitness:163 Convergence:1 Best: • ** Qfg kipe me zeyagse I'm a syfgndrek. There aren't enfglh syfgndreks in qfgr kibe. -Harrisfn Bfrd, The Emjire Stripes Zayp • Gen #350 Diversity:0.808347 Fitness:163 Convergence:1 Best: • ** Qfg kipe me zeyagse I'm a syfgndrek. There aren't enfglh syfgndreks in qfgr kibe. -Harrisfn Bfrd, The Emjire Stripes Zayp • Gen #2550 Diversity:0.34339 Fitness:532 Convergence:1 Best: • ** You like me because I'm a scoundrel. Tgere aren't enouzg scoundrels in your life. -Garrison Ford, Tge Empire Strikes Back • Gen #2600 Diversity:0.345111 Fitness:538 Convergence:1 Best: • ** You like me because I'm a scoundrel. There aren't enough scoundrels in your life. -Harrison Ford, The Empire Strikes Back [encoding][fitness][selection][population][mutation][crossover]

  17. Sample Applications • Crypto (quote) • Satellite Scheduling • Combinatorial Chemistry • Biological Interaction Networks • Financial Pattern Detection

  18. Satellite Scheduling • In this problem we were tasked with optimizing the maintenance tasks of a fleet of satellites. • Goal: Schedule maintenance on the satellites so as to minimize loss of the resource (or maximize dollars). • In short, don’t do maintenance when you could be providing services. • Thoughts? [encoding][fitness][selection][population][mutation][recombination]

  19. Sat. City Instance Start End Priority 1 Beijing 1 27.01 55.06 2 1 Beijing 2 157.86 186.3 2 1 Beijing 3 289.76 311.11 3 1 Beijing 4 878.41 893.21 3 1 Beijing 5 999.66 1027.08 2 1 Beijing 6 1129.25 1157.81 2 1 Beijing 7 1263.34 1289.86 3 1 Beijing 8 1397.66 1424.56 2 1 Bombay 1 159.56 173.91 3 1 Bombay 2 287.46 314.55 2 1 Bombay 3 417.51 445.26 1 1 Bombay 4 555.91 559.96 2 1 Bombay 5 1116.15 1143.41 2 1 Bombay 6 1246.2 1273.75 2 1 Bombay 7 1385.6 1401.85 3 1 BuenosAires 1 95.01 123.75 3 1 BuenosAires 2 226.01 251.86 2 1 BuenosAires 3 934.91 960.91 2 1 BuenosAires 4 1063.16 1091.86 3 1 BuenosAires 5 1197.4 1223.05 3 1 BuenosAires 6 1356.76 1357.93 3 1 Calcutta 1 28.31 40.01 3 1 Calcutta 2 159.05 183.15 2 1 Calcutta 3 288.51 317.25 2 1 Calcutta 4 420.8 443.61 2 1 Calcutta 5 993.5 1014.65 2 1 Calcutta 6 1118.9 1147.56 2 1 Calcutta 7 1252.16 1277.16 2 1 Calcutta 8 1394.61 1407.4 3 Satellite SchedulingBackground • Input into the system is the time andlength of all “coverage” events. [encoding][fitness][selection][population][mutation][recombination]

  20. Satellite SchedulingMore Background • You also have the suite of task types: • Battery Offline : Executed when a battery must be put offline (1) • Battery Recondition : Forces a full reconditioning of a battery. This event must be scheduled to occur on a somewhat periodic basis. Batteries require full reconditioning after spending a period of time being intermittently charged and discharged (2) • Momentum Dump: A fairly short task which allows a satellite to maintain it’s orbit (3) • Keep Station : this task is also related to the mechanics of maintaining orbit (3) • Verify Link : This test the satellite’s ability to communicate with ground stations.(3) • Calibrate : General maintenance (3) • State of Health : send a measure of the satellite’s state to a ground station (4) • Self Destruct: Burn up satellite in atmosphere [encoding][fitness][selection][population][mutation][recombination]

  21. Satellite Schedulingeven more background … • You have the set of tasks which youmust schedule on this particular constellation of satellites. Typical Task Set param : Tasks : dur start_after finish_by := 1 BatteryRecond 1 GS_Any 50 0 1440 1 Calibrate 1 GS_Any 0.34 0 1440 1 KeepStation 1 GS_Any 16 0 1440 1 StateOfHealth 1 GS_Any 10 0 720 1 StateOfHealth 2 GS_Any 10 360 1080 1 StateOfHealth 3 GS_Any 10 720 1440 [encoding][fitness][selection][population][mutation][recombination]

  22. Satellite Schedulingstill more background … • Oh, and by the way, there are constraintson when you can/cannot do these tasks. Type City Ground Station Eclipse I/w types 1,2,3 I/w type 4 1 Shrinks Shrinks No Interaction No Overlap No Interaction 2 Shrinks No Interaction No Overlap No Overlap No Interaction 3 No Interaction Within No Interaction No Overlap No Interaction 4 No Interaction Within No Interaction No Interaction No Overlap [encoding][fitness][selection][population][mutation][recombination]

  23. Satellite Schedulingencoding/representation • Each allele position associated with onetask on one satellite to be scheduled • Value is the time (as a double) when theassociated task is scheduled • Constraints on values corresponding to constraints in problem. [encoding][fitness][selection][population][mutation][crossover]

  24. Satellite Schedulingencoding static constraints • Static constraints for ground station tasks • Static constraints for eclipses [encoding][fitness][selection][population][mutation][crossover]

  25. Satellite Schedulingfitness/objective • Maximize “free” time • Handle dynamic constraints via dynamic penalties • Task “collisions” deduct from fitness score. • Penalties increase as the system evolves inlater generations [encoding][fitness][selection][population][mutation][crossover]

  26. Satellite Scheduling selection • Tournament selection worked notablybetter than other options tested. • (roulette, uniform and rank also tested) [encoding][fitness][selection][population][mutation][crossover]

  27. Satellite Scheduling population • Size/Generations: • Nothing special here, a few hundred individuals for a few hundred generations • Initialization: • Each individual had to adhere to the constraints of the problem. Simply initialize to the static constraints defined earlier [encoding][fitness][selection][population][mutation][crossover]

  28. Satellite Scheduling mutation • Gaussian Mutation • More appropriate to real values than the typical bit flip • Less destructive than a totally new value arabidopsis [encoding][fitness][selection][population][mutation][crossover]

  29. Satellite Scheduling recombination/crossover Dad Mom • Typical crossover: Randomly Selected Crossover Point Sis Bro [encoding][fitness][selection][population][mutation][crossover]

  30. Relaxed Exploitation Exploration Exploration Exploitation P2 P1 Satellite Scheduling recombination/crossover • BLx Crossover • Has the following perception … [encoding][fitness][selection][population][mutation][crossover]

  31. Satellite Scheduling recombination/crossover Assume that P1_A and P2_A are a large distance apart, while P1_B and P2_B are quite close to one another. Choosing a point between P1_A and P2_A might be viewed as being more exploratory and less as exploitation. Meanwhile, a point chosen between P1_B and P2_B could be viewed as a great amount of exploitation and very little exploration. • Crossover of Real #’s P1_B P1_A P2_B P2_A [encoding][fitness][selection][population][mutation][crossover]

  32. Satellite Scheduling recombination/crossover • Parent-Weighted Crossover • Balances BLx in the case where the distance between p1 & p2 is large Exploration Exploitation Exploration Exploitation Exploration P2 P1 [encoding][fitness][selection][population][mutation][crossover]

  33. Satellite Scheduling results • Was able to reach solutions onlyseconds different from provable optimum as computed by LP with comparable computing time. • Provides an ensemble of solutions [encoding][fitness][selection][population][mutation][crossover]

  34. Sample Applications • Crypto (quote) • Satellite Scheduling • Combinatorial Chemistry • Biological Interaction Networks • Financial Pattern Detection

  35. Combinatorial Chemistryshort but sweet • Explored Uncharted Chemical Space • 8 Allele positions • Four chemicals (selected from a given set) and their concentrations • Fitness Function was a physical experiment. • A generation of 50 individuals took two weeks • Returned “turnover” numbers for each compound [encoding][fitness][selection][population][mutation][recombination]

  36. Sample Applications • Crypto (quote) • Satellite Scheduling • Combinatorial Chemistry • Biological Interaction Networks • Financial Pattern Detection

  37. Biological Interaction Networks • Goal is to evolve networks of interacting“proteins” such that the network exhibits a specific desired functionality/behavior. [encoding][fitness][selection][population][mutation][recombination]

  38. Sample Applications • Crypto (quote) • Satellite Scheduling • Combinatorial Chemistry • Biological Interaction Networks • Financial Pattern Detection

  39. Financial Pattern Detection • GA Trains on finacial data and devises patternswhich classify companies as fraud/non-fraud. [encoding][fitness][selection][population][mutation][recombination]

More Related