Cec09

Loading...

Flash Player 9 (or above) is needed to view presentations.
We have detected that you do not have it on your computer. To install it, go here.

0 comments

Post a comment

    Post a comment
    Embed Video
    Edit your comment Cancel

    Favorites, Groups & Events

    Cec09 - Presentation Transcript

    1. Lourdes Araujo UNED Juan J. Merelo Guervós Univ. de Granada MULTIKULTI ALGORITHM: USING GENOTYPIC DIFFERENCES IN ADAPTIVE DISTRIBUTED EVOLUTIONARY ALGORITHM MIGRATION POLICIES
    2. Motivation
      • Island model improves sequential exec.
      • Asynchronous models better
      • Asynchronous populations better
       Diversity advantages
    3. Hypothesis
      • Exchanging best individuals is not always the best
      Population 1 Population 2
    4. Hypothesis ? ? ? ? ? ?
    5. Hypothesis
    6. Criteria to select migrant individuals
      • The most different to the receiving population.
      • The most different to the receiving population taking from an elite
    7. Which is the most different to the whole destination population? Representing the population:
      • The best
      • Consensus sequence
    8. Consensus sequence Composed of the most frequent allele for each gen. 1 0 1 1 1 0 0 1 1 0 0 0 1 0 1 1 0 0 1 1 1 0 0 1 0 1 1 0 0 0 1 0 1 1 0 0 1 1 1 1 0 0 0 0 1 0 1 0 1 1 1 CS: 0 0 1 1 1 0 0 0 1 0 0 0 1 0 1 1 1
    9. Our model Genotype representation G2 “ rather” different to G2 G1 G3 “ rather” different to G3 P3 P1 P2 Pn
    10. Implementation
      • Chromosomes: fixed length binary strings
      • Crossover: two points and GBX (respects gene boundaries)
      • Mutation: single-bit-flip
      • Perl implementation
      • Simulated parallel environment
    11. Tested problems P-Peaks: P=100, N=64, 100, 128
    12. Tested problems fitness si (0) = 1.0 fitness si (1) = 0.0 fitness si (2) = 0.360384 fitness si (3) = 0.640576 fitness si (4) = 0.360384 fitness si (5) = 0.0 fitness si (6) = 1.0 MMDP: K=15, 20
    13. Results: P-Peaks (N=64, 2 nodes)‏
    14. Results: P-Peaks(N=64, 4 nodes)
    15. Results: P-Peaks(N=64, 8 nodes)
    16. Results: MMDP(90 bits, 2pX, 2 nodes)
    17. Results: MMDP(90 bits, 2pX, 4 nodes)
    18. Results: MMDP(120 bits,GBX, 2 nodes)
    19. Entropy:
    20. Entropy: averages
    21. Future works Conclusions
      • Diversity improves the results provided
      • the individual is good enough
      • Entropy tests reveal a real increase in
      • diversity
      • Both, the best individual and the consensus sequence are good representatives of the population
      Conclusions
      • Parallel implementation
      • Studying other parameters and problems
    22. Thanks! Any question?

    + jjmerelojjmerelo, 6 months ago

    custom

    212 views, 0 favs, 1 embeds more stats

    Slides for "Multikulti Algorithm": using genotypic more

    More info about this document

    © All Rights Reserved

    Go to text version

    • Total Views 212
      • 204 on SlideShare
      • 8 from embeds
    • Comments 0
    • Favorites 0
    • Downloads 0
    Most viewed embeds
    • 8 views on http://nohnes.wordpress.com

    more

    All embeds
    • 8 views on http://nohnes.wordpress.com

    less

    Flagged as inappropriate Flag as inappropriate
    Flag as inappropriate

    Select your reason for flagging this presentation as inappropriate. If needed, use the feedback form to let us know more details.

    Cancel
    File a copyright complaint
    Having problems? Go to our helpdesk?

    Categories