Complex and dynamic population structures: synthesis, open questions, and future directions

The population structure of an evolutionary algorithm influences the dissemination and mixing of advantageous alleles, and therefore affects search performance. Much recent attention has focused on the analysis of complex population structures, characterized by heterogeneous connectivity distributions, non-trivial clustering properties, and degree–degree correlations. Here, we synthesize the results of these recent studies, discuss their limitations, and highlight several open questions regarding (1) unsolved theoretical issues and (2) the practical utility of complex population structures for evolutionary search. In addition, we will discuss an alternative complex population structure that is known to significantly influence dynamical processes, but has yet to be explored for evolutionary optimization. We then shift our attention toward dynamic population structures, which have received markedly less attention than their static counterparts. We will discuss the strengths and limitations of extant techniques and present open theoretical and experimental questions and directions for future research. In particular, we will focus on the prospects of “active linking,” wherein edges are dynamically rewired according to the genotypic or phenotypic properties of individuals, or according to the success of prior inter-individual interactions.

[1]  G. Unter Rudolph Takeover Times of Noisy Non-Generational Selection Rules that Undo Extinction , 2001 .

[2]  Daniel A. Ashlock,et al.  Graph-based evolutionary algorithms , 2006, IEEE Transactions on Evolutionary Computation.

[3]  Marco Tomassini,et al.  Takeover time curves in random and small-world structured populations , 2005, GECCO '05.

[4]  Leo Breiman,et al.  Bagging Predictors , 1996, Machine Learning.

[5]  Stefano Panzieri,et al.  Effect of topology on diversity of spatially-structured evolutionary algorithms , 2011, GECCO '11.

[6]  Alex S. Fukunaga,et al.  Restart Scheduling for Genetic Algorithms , 1998, PPSN.

[7]  Alessandro Vespignani,et al.  Absence of epidemic threshold in scale-free networks with degree correlations. , 2002, Physical review letters.

[8]  Alessandro Vespignani,et al.  EPIDEMIC SPREADING IN SCALEFREE NETWORKS , 2001 .

[9]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[10]  C. Hauert,et al.  Reputation-based partner choice promotes cooperation in social networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Stuart A. Kauffman,et al.  ORIGINS OF ORDER IN EVOLUTION: SELF-ORGANIZATION AND SELECTION , 1992 .

[12]  Günter Rudolph,et al.  Takeover Times of Noisy Non-Generational Selection Rules that Undo Extinction , 2001 .

[13]  David G. Rand,et al.  Positive Interactions Promote Public Cooperation , 2009, Science.

[14]  Reiko Tanese,et al.  Parallel Genetic Algorithms for a Hypercube , 1987, ICGA.

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

[16]  Márk Jelasity,et al.  Gossip-based aggregation in large dynamic networks , 2005, TOCS.

[17]  James A. Hendler,et al.  Trust Networks on the Semantic Web , 2003, WWW.

[18]  Andrea Gasparri,et al.  A spatially structured genetic algorithm for multi-robot localization , 2009, Intell. Serv. Robotics.

[19]  Peter Sheridan Dodds,et al.  Information cascades on degree-correlated random networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Juan Julián Merelo Guervós,et al.  EvAg: a scalable peer-to-peer evolutionary algorithm , 2010, Genetic Programming and Evolvable Machines.

[21]  Ruhul A. Sarker,et al.  Making and breaking power laws in evolutionary algorithm population dynamics , 2009, Memetic Comput..

[22]  Bernard Manderick,et al.  Fine-Grained Parallel Genetic Algorithms , 1989, ICGA.

[23]  Max M. Krasnow,et al.  Evolution of direct reciprocity under uncertainty can explain human generosity in one-shot encounters , 2011, Proceedings of the National Academy of Sciences.

[24]  Jinhang Li,et al.  Scale-free properties of information flux networks in genetic algorithms , 2012 .

[25]  Xiang Li,et al.  Roles of mixing patterns in cooperation on a scale-free networked game. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  F. C. Santos,et al.  Scale-free networks provide a unifying framework for the emergence of cooperation. , 2005, Physical review letters.

[27]  Jason H. Moore,et al.  Sexual Recombination in Self-Organizing Interaction Networks , 2010, EvoApplications.

[28]  Marco Tomassini,et al.  Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA , 2006, EvoCOP.

[29]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

[30]  A-L Barabási,et al.  Structure and tie strengths in mobile communication networks , 2006, Proceedings of the National Academy of Sciences.

[31]  Dana S. Richards,et al.  Punctuated Equilibria: A Parallel Genetic Algorithm , 1987, ICGA.

[32]  Robert L. Stewart,et al.  Multiobjective Evolutionary Algorithms on Complex Networks , 2006, EMO.

[33]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[34]  Grant Dick,et al.  Exploring the use of ancestry as a unified network model of finite population evolution , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[35]  Margaret J. Eppstein,et al.  The influence of scaling and assortativity on takeover times in scale-free topologies , 2008, GECCO '08.

[36]  Bo Peng,et al.  Empirical Analysis of the Spatial Genetic Algorithm on Small-World Networks , 2006, International Conference on Computational Science.

[37]  Martin A. Nowak,et al.  Evolutionary dynamics on graphs , 2005, Nature.

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

[39]  Enrique Alba,et al.  Parallelism and evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

[40]  Enrique Alba,et al.  The exploration/exploitation tradeoff in dynamic cellular genetic algorithms , 2005, IEEE Transactions on Evolutionary Computation.

[41]  L. Amaral,et al.  The web of human sexual contacts , 2001, Nature.

[42]  Enrique Alba,et al.  Cellular genetic algorithms , 2014, GECCO.

[43]  Sébastien Vérel,et al.  Centric selection: a way to tune the exploration/exploitation trade-off , 2009, GECCO.

[44]  S. Redner,et al.  Voter models on heterogeneous networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[45]  M E J Newman Assortative mixing in networks. , 2002, Physical review letters.

[46]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[47]  Margaret J. Eppstein,et al.  Emergent mating topologies in spatially structured genetic algorithms , 2006, GECCO.

[48]  Samir W. Mahfoud Niching methods for genetic algorithms , 1996 .

[49]  G. Rudolph On Takeover Times in Spatially Structured Populations : Array and Ring , 2001 .

[50]  Grant Dick,et al.  Evolutionary dynamics for the spatial Moran process , 2008, Genetic Programming and Evolvable Machines.

[51]  R. Riolo,et al.  Evolution of cooperation without reciprocity , 2001, Nature.

[52]  Juan Julián Merelo Guervós,et al.  P2P Evolutionary Algorithms: A Suitable Approach for Tackling Large Instances in Hard Optimization Problems , 2008, Euro-Par.

[53]  Hitoshi Iba,et al.  Polynomial selection scheme with dynamic parameter estimation in cellular genetic algorithm , 2011, GECCO '11.

[54]  Ruhul A. Sarker,et al.  The Self-Organization of Interaction Networks for Nature-Inspired Optimization , 2008, IEEE Transactions on Evolutionary Computation.

[55]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[56]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[57]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[58]  D. Watts,et al.  Multiscale, resurgent epidemics in a hierarchical metapopulation model. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[59]  Michael Kirley,et al.  An analysis of the effects of clustering in graph-based evolutionary algorithms , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[60]  下平 丕作士,et al.  The Genetic and Evolutionary Computation Conference , 2002 .

[61]  Margaret J. Eppstein,et al.  Pair Approximations of Takeover Dynamics in Regular Population Structures , 2009, Evolutionary Computation.

[62]  Andrea Gasparri,et al.  A Spatially Structured Genetic Algorithm over Complex Networks for Mobile Robot Localisation , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[63]  Kenneth A. De Jong,et al.  An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms , 1996, PPSN.

[64]  Sébastien Vérel,et al.  Anisotropic selection in cellular genetic algorithms , 2006, GECCO.

[65]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[66]  Margaret J. Eppstein,et al.  Evolutionary Dynamics on Scale-Free Interaction Networks , 2009, IEEE Transactions on Evolutionary Computation.

[67]  Margaret J. Eppstein,et al.  Takeover times on scale-free topologies , 2007, GECCO '07.

[68]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[69]  Pascal Bouvry,et al.  Study of different small-world topology generation mechanisms for Genetic Algorithms , 2012, 2012 IEEE Congress on Evolutionary Computation.

[70]  Arne Traulsen,et al.  Repeated games and direct reciprocity under active linking. , 2008, Journal of theoretical biology.

[71]  Duncan J Watts,et al.  A simple model of global cascades on random networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[72]  Robert L. Stewart,et al.  An analysis of the effects of population structure on scalable multiobjective optimization problems , 2007, GECCO '07.

[73]  Stuart A. Kauffman,et al.  The origins of order , 1993 .

[74]  A. Wagner The yeast protein interaction network evolves rapidly and contains few redundant duplicate genes. , 2001, Molecular biology and evolution.

[75]  Enrique Alba,et al.  Introduction to Cellular Genetic Algorithms , 2008 .

[76]  A. E. Eiben,et al.  Peer-to-peer evolutionary algorithms with adaptive autonomous selection , 2007, GECCO '07.

[77]  Enrique Alba,et al.  Selection intensity in cellular evolutionary algorithms for regular lattices , 2005, IEEE Transactions on Evolutionary Computation.

[78]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[79]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.