ACM Home Page
Please provide us with feedback. Feedback
Genotypic differences and migration policies in an island model
Full text PdfPdf (339 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
SESSION: Track 12: parallel evolutionary systems table of contents
Pages 1331-1338  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Lourdes Araujo  Universidad nacional de Educación a Distancia, Madrid, Spain
Juan Julian Merelo  Universidad de Granada, Granada, Spain
Antonio Mora  Universidad de Granada, Granada, Spain
Carlos Cotta  Universidad de Málaga, Málaga, Spain
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 35,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1570080
What is a DOI?

ABSTRACT

In this paper we compare different policies to select individuals to migrate in an island model. Our thesis is that choosing individuals in a way that exploits differences between populations can enhance diversity, and improve the system performance. This has lead us to propose a family of policies that we call multikulti, in which nodes exchange individuals different "enough" among them. In this paper we present a policy according to which the receiver node chooses the most different individual among the sample received from the sending node. This sample is randomly built but only using individuals with a fitness above a threshold. This threshold is previously established by the receiving node. We have tested our system in two problems previously used in the evaluation of parallel systems, presenting different degree of difficulty. The multikulti policy presented herein has been proved to be more robust than other usual migration policies, such as sending the best or a random individual.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
 
6
L. Araujo, J.J. Merelo, C. Cotta, and F. de Vega. MultiKulti Algorithm: Migrating the Most Different Genotypes in an Island Model. ArXiV preprint arXiv:0806.2843, 2008.
 
7
E. Cantú-Paz. Migration policies and takeover times in genetic algorithms. In GECCO, page 775, 1999.
 
8
 
9
R.J. Collins and D.R. Jefferson. Selection in massively parallel genetic algorithms. In R.K. Belew and L.B. Booker, editors, Proceedings of the 4th International Conference on Genetic Algorithms, pages 249--256, San Diego, CA, 1991. Morgan Kaufmann.
10
 
11
J. Denzinger and J. Kidney. Improving migration by diversity. In 2003 Congress on Evolutionary Computation, volume 1, pages 700--707. IEEE Press, 2003.
 
12
T. Eldos. A New Migration Model For Distributed Genetic Algorithms. In Proceedings of the International Conference on Scientific Computing (CSC' 06), Las Vegas, NV, pages 128--134, 2006.
 
13
M. Giacobini, M. Preuss, and M. Tomassini. Effects of scale-free and small-world topologies on binary coded self-adaptive CEA. In J. Gottlieb and G.R. Raidl, editors, Evolutionary Computation in Combinatorial Optimization -- EvoCOP 2006, volume 3906 of LNCS, pages 85--96, Budapest, 10-12 April 2006. Springer Verlag.
 
14
D.E. Goldberg, K. Deb, and J. Horn. Massive multimodality, deception, and genetic algorithms. In R. Männer and B. Manderick, editors, Parallel Problem Solving from Nature, 2, Amsterdam, 1992. Elsevier Science Publishers, B.V.J.J. Merelo. Evolutionary computation in Perl. In M. Perl Mongers, editor, YAPC:Europe::2002, pages 2--22, 2002.
 
15
E.D.D. Jong, R.A. Watson, and J.B. Pollack. Reducing Bloat and Promoting Diversity using Multi-Objective Methods. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001, pages 11--18. Morgan Kaufmann Publishers, 2001.
 
16
K.A.D. Jong, M.A. Potter, and W.M. Spears. Using problem generators to explore the effects of epistasis. In T. Bäck, editor, Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA97), San Francisco, CA, 1997. Morgan Kaufmann.
 
17
 
18
P. Moscato and M.G. Norman. A Memetic Approach for the Traveling Salesman Problem Implementation of a Computational Ecology for Combinatorial Optimization on Message-Passing Systems. In M. Valero, E. Onate, M. Jane, J.L. Larriba, and B. Suarez, editors, Parallel Computing and Transputer Applications, pages 177--186, Amsterdam, 1992. IOS Press.
 
19
H. Muhlenbein. Evolution in time and space -- the parallel genetic algorithm. In G. Rawlings, editor, Foundations of Genetic Algorithms, pages 316--337. Morgan Kaufmann, 1991.
 
20
E. Noda, A. Coelho, I. Ricarte, A. Yamakami, and A. Freitas. Devising adaptive migration policies for cooperative distributed genetic algorithms. IEEE International Conference on Systems, Man and Cybernetics, 2002, pp. 6.
 
21
D. Power, C. Ryan, and R. Azad. Promoting diversity using migration strategies in distributed genetic algorithms. IEEE Conqress on Evolutionary Computation, 2:1831--1838, 2005.
 
22
P. Spiessens and B. Manderick. A massively parallel genetic algorithm: Implementation and first analysis. In R.K. Belew and L.B. Booker, editors, Proceedings of the 4th International Conference on Genetic Algorithms, pages 279--287, San Diego, CA, 1991. Morgan Kaufmann.
 
23
J. Stender. Parallel Genetic Algorithms: Theory and Applications, chapter Implementation in Occam of Parallel Genetic Algorithms on Transputer Networks. IOS Press, 1993.
 
24
R. Tanese. Distributed genetic algorithms. In J.D. Schaeffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 434--439, San Mateo, California, 1989. Morgan Kaufmann Publishers.
 
25
 
26
R.K. Ursem. Diversity-guided evolutionary algorithms.
 
27
In J.J. Merelo, P. Adamidis, H.-G. Beyer, J.L.F.-V. Martín, and H.-P. Schwefel, editors, PPSN, volume 2439 of Lecture Notes in Computer Science, pages 462--474. Springer, 2002.
 
28
J. Ward and J. Stanford. Intermediate-Disturbance Hypothesis: An Explanation for Biotic Diversity Patterns in Lotic Ecosystems. Dynamics of Lotic Systems, Ann Arbor Science, Ann Arbor MI. 1983. 347--356 p, 2 fig, 35 ref., 1983.
 
29
D. Whitley, S. Rana, and R. Heckendorn. The island model genetic algorithm: On separability, population size and convergence. Journal of Computing and Information Technology, 7:33--47, 1999.
 
30
S. Yang and R. Tinós. A hybrid immigrants scheme for genetic algorithms in dynamic environments. International Journal of Automation and Computing, 4(3):243--254, 2007.

Collaborative Colleagues:
Lourdes Araujo: colleagues
Juan Julian Merelo: colleagues
Antonio Mora: colleagues
Carlos Cotta: colleagues