Runtime analysis of population-based evolutionary algorithms: introductory tutorial at GECCO 2017

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for thirdparty components of this work must be honored. For all other uses, contact the owner/author(s). GECCO ’17 Companion, July 15-19, 2017, Berlin, Germany c ©2017 Copyright is held by the owner/author(s). ACM ISBN 978-1-4503-4939-0/17/07. http://dx.doi.org/10.1145/3067695.3067714

[1]  Carsten Witt,et al.  Runtime Analysis of the ( μ +1) EA on Simple Pseudo-Boolean Functions , 2006 .

[2]  Duc-Cuong Dang,et al.  Refined upper bounds on the expected runtime of non-elitist populations from fitness-levels , 2014, GECCO.

[3]  Per Kristian Lehre,et al.  Negative Drift in Populations , 2010, PPSN.

[4]  Xin Yao,et al.  Towards an analytic framework for analysing the computation time of evolutionary algorithms , 2003, Artif. Intell..

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

[6]  Duc-Cuong Dang,et al.  Level-Based Analysis of Genetic Algorithms and Other Search Processes , 2014, bioRxiv.

[7]  Pietro Simone Oliveto,et al.  Theoretical analysis of fitness-proportional selection: landscapes and efficiency , 2009, GECCO.

[8]  Xin Yao,et al.  A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[9]  Dirk Sudholt,et al.  The choice of the offspring population size in the (1,λ) EA , 2012, GECCO '12.

[10]  Christine Zarges,et al.  On the utility of the population size for inversely fitness proportional mutation rates , 2009, FOGA '09.

[11]  Pietro Simone Oliveto,et al.  On the runtime analysis of the Simple Genetic Algorithm , 2014, Theor. Comput. Sci..

[12]  Duc-Cuong Dang,et al.  Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms , 2016, PPSN.

[13]  Per Kristian Lehre,et al.  On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms , 2012, IEEE Trans. Evol. Comput..

[14]  Pietro Simone Oliveto,et al.  Improved time complexity analysis of the Simple Genetic Algorithm , 2015, Theor. Comput. Sci..

[15]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[16]  Kenneth A. De Jong,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods on the Choice of the Offspring Population Size in Evolutionary Algorithms on the Choice of the Offspring Population Size in Evolutionary Algorithms , 2004 .