Lourdes Araujo
Carlos Cotta
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.
- M. Affenzeller and S. Wagner. Sasegasa: A new generic parallel evolutionary algorithm for achieving highest quality results. Journal of Heuristics, 10(3):243--267, 2004. Google Scholar
Digital Library
- E. Alba and B. Dorronsoro. Cellular Genetic Algorithms. Springer, New York, 2008. ISBN 978-0-387-77609-5. Google ScholarDigital Library
- E. Alba, A.J. Nebro, and J.M. Troya. Heterogeneous computing and parallel genetic algorithms. J. Parallel Distrib. Comput., 62(9):1362--1385, 2002. Google ScholarDigital Library
- E. Alba and J.M. Troya. Influence of the migration policy in parallel distributed gas with structured and panmictic populations. Appl. Intell., 12(3):163--181, 2000. Google ScholarDigital Library
- E. Alba and J.M. Troya. Analyzing synchronous and asynchronous parallel distributed genetic algorithms. Future Generation Comp. Syst., 17(4):451--465, 2001. Google ScholarDigital Library
- 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.Google Scholar
- E. Cantú-Paz. Migration policies and takeover times in genetic algorithms. In GECCO, page 775, 1999.Google Scholar
- E. Cantú-Paz. Migration policies, selection pressure, and parallel evolutionary algorithms. Journal of Heuristics, 7(4):311--334, 2001. Google ScholarDigital Library
- 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.Google Scholar
- K. De Jong. Evolutionary computation: a unified approach. In Proceedings of the 2008 GECCO conference companion on Genetic and evolutionary computation, pages 2245--2258. ACM New York, NY, 2008. Google ScholarDigital Library
- J. Denzinger and J. Kidney. Improving migration by diversity. In 2003 Congress on Evolutionary Computation, volume 1, pages 700--707. IEEE Press, 2003.Google ScholarCross Ref
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- J.J. Merelo, A.M. Mora, P.A. Castillo, J.L.J. Laredo, L. Araujo, K.C. Sharman, A.I. Esparcia-Alc'azar, E. Alfaro-Cid, and C. Cotta. Testing the intermediate disturbance hypothesis: Effect of asynchronous population incorporation on multi-deme evolutionary algorithms. In Parallel Problem Solving from Nature -- PPSN X, pages 266--275, 2008.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google ScholarCross Ref
- 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.Google Scholar
- 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.Google Scholar
- J. Stender. Parallel Genetic Algorithms: Theory and Applications, chapter Implementation in Occam of Parallel Genetic Algorithms on Transputer Networks. IOS Press, 1993.Google Scholar
- 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. Google ScholarDigital Library
- M. Tomassini. Spatially Distributed Evolutionary Algorithms. Natural Computing Series. Springer-Verlag, Berlin Heidelberg, 2005. Google ScholarDigital Library
- R.K. Ursem. Diversity-guided evolutionary algorithms.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google ScholarCross Ref
Index Terms
- Genotypic differences and migration policies in an island model
Recommendations
Island-based harmony search for optimization problems
Island model are embedded within framework of HS algorithm to build iHS.Island number ( I n ), migration frequency ( F m ), migration rate ( R m ) are iHS parameters.Higher values of I n and F m lead to better results but R m value needs to be ...
Analysis of evolutionary multi-tasking as an island model
GECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference CompanionRecently, an idea of evolutionary multi-tasking has been proposed and applied to various types of optimization problems. The basic idea of evolutionary multi-tasking is to simultaneously solve multiple optimization problems (i.e., tasks) in a ...
Island-based Cuckoo Search with elite opposition-based learning and multiple mutation methods for solving optimization problems
AbstractThe island Cuckoo Search (iCSPM) algorithm is a variation of Cuckoo Search that uses the island model and highly disruptive polynomial mutation to solve optimization problems. This article introduces an improved iCSPM algorithm called iCSPM with ...
Comments