Design and Analysis of Schemes for Adapting Migration Intervals in Parallel Evolutionary Algorithms

The migration interval is one of the fundamental parameters governing the dynamic behaviour of island models. Yet, there is little understanding on how this parameter affects performance, and how to optimally set it given a problem in hand. We propose schemes for adapting the migration interval according to whether fitness improvements have been found. As long as no improvement is found, the migration interval is increased to minimise communication. Once the best fitness has improved, the migration interval is decreased to spread new best solutions more quickly. We provide a method for obtaining upper bounds on the expected running time and the communication effort, defined as the expected number of migrants sent. Example applications of this method to common example functions show that our adaptive schemes are able to compete with, or even outperform, the optimal fixed choice of the migration interval, with regard to running time and communication effort.

[1]  Per Kristian Lehre,et al.  Fitness-levels for non-elitist populations , 2011, GECCO '11.

[2]  Dirk Sudholt,et al.  General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms , 2010, PPSN.

[3]  Enrique Alba,et al.  Parallel evolutionary algorithms can achieve super-linear performance , 2002, Inf. Process. Lett..

[4]  Pietro Simone Oliveto,et al.  On the effectiveness of crossover for migration in parallel evolutionary algorithms , 2011, GECCO '11.

[5]  Per Kristian Lehre,et al.  Black-box Complexity of Parallel Search with Distributed Populations , 2015, FOGA.

[6]  Enrique Alba,et al.  Parallel Genetic Algorithms , 2011, Studies in Computational Intelligence.

[7]  Enrique Alba,et al.  Parallel metaheuristics: recent advances and new trends , 2012, Int. Trans. Oper. Res..

[8]  Tzung-Pei Hong,et al.  Revisiting the Design of Adaptive Migration Schemes for Multipopulation Genetic Algorithms , 2012, 2012 Conference on Technologies and Applications of Artificial Intelligence.

[9]  Dirk Sudholt,et al.  Design and analysis of adaptive migration intervals in parallel evolutionary algorithms , 2014, GECCO.

[10]  Jörg Lässig,et al.  General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms , 2012, ArXiv.

[11]  Günter Rudolph,et al.  Takeover time in parallel populations with migration , 2006 .

[12]  Dirk Sudholt,et al.  A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms , 2011, IEEE Transactions on Evolutionary Computation.

[13]  Enrique Alba,et al.  Distributed evolutionary algorithms with adaptive migration period , 2011, 2011 11th International Conference on Intelligent Systems Design and Applications.

[14]  Dirk Sudholt,et al.  Analysis of speedups in parallel evolutionary algorithms and (1+λ) EAs for combinatorial optimization , 2014, Theor. Comput. Sci..

[15]  Enrique Alba,et al.  Influence of the Migration Period in Parallel Distributed GAs for Dynamic Optimization , 2012, LION.

[16]  Per Kristian Lehre,et al.  Unbiased Black-Box Complexity of Parallel Search , 2014, PPSN.

[17]  Ingo Wegener,et al.  Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , 2003 .

[18]  Marco Tomassini,et al.  Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series) , 2005 .

[19]  Dirk Sudholt,et al.  Adaptive population models for offspring populations and parallel evolutionary algorithms , 2011, FOGA '11.

[20]  Juan Julián Merelo Guervós,et al.  Diversity Through Multiculturality: Assessing Migrant Choice Policies in an Island Model , 2011, IEEE Transactions on Evolutionary Computation.

[21]  Dirk Sudholt,et al.  General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms* , 2014, Evolutionary Computation.

[22]  Dirk Sudholt,et al.  Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract) , 2011, ISAAC.

[23]  Enrique Alba,et al.  Theoretical models of selection pressure for dEAs: topology influence , 2005, 2005 IEEE Congress on Evolutionary Computation.

[24]  Tzung-Pei Hong,et al.  Experimental analysis of dynamic migration intervals on 0/1 knapsack problems , 2007, 2007 IEEE Congress on Evolutionary Computation.

[25]  Thomas Jansen,et al.  UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization , 2004 .

[26]  Enrique Alba,et al.  Using theory to self-tune migration periods in distributed genetic algorithms , 2013, 2013 IEEE Congress on Evolutionary Computation.

[27]  Zbigniew Skolicki,et al.  The influence of migration sizes and intervals on island models , 2005, GECCO '05.

[28]  Per Kristian Lehre,et al.  Black-Box Search by Unbiased Variation , 2010, GECCO '10.

[29]  Dirk Sudholt,et al.  Homogeneous and Heterogeneous Island Models for the Set Cover Problem , 2012, PPSN.

[30]  Dirk Sudholt,et al.  Design and analysis of migration in parallel evolutionary algorithms , 2013, Soft Comput..