Per Kristian Lehre
Pietro S. Oliveto
ABSTRACT
Evolutionary algorithm theory has studied the time complexity of evolutionary algorithms for more than 20 years. Different aspects of this rich and diverse research field were presented in four different advanced or specialized tutorials at last year's GECCO. This tutorial presents the foundations of this field. We introduce the most important notions and definitions used in the field and consider different evolutionary algorithms on a number of well-known and important example problems. Through a careful and thorough introduction of important analytical tools and methods, including fitness-based partitions, typical events and runs and drift analysis, by the end of the tutorial the attendees will be able to apply these techniques to derive relevant runtime results for non-trivial evolutionary algorithms. Moreover, the attendees will be fully prepared to follow the more advanced tutorials that cover more specialized aspects of the field, including the new advanced runtime analysis tutorial on realistic population-based EAs. To assure the coverage of the topics required in the specialised tutorials, this introductory tutorial will be coordinated with the presenters of the more advanced ones. In addition to custom-tailored methods for the analysis of evolutionary algorithms we also introduce the relevant tools and notions from probability theory in an accessible form. This makes the tutorial appropriate for everyone with an interest in the theory of evolutionary algorithms without the need to have prior knowledge of probability theory and analysis of randomized algorithms. The last two editions of this tutorial at GECCO 2013 and GECCO 2014 attracted over 50 participants each.
- Bäck, T. (1993). Optimal mutation rates in genetic search. In Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA), pages 2--8. Google Scholar
Digital Library
- Dang, D.-C. and Lehre, P. K. (2014). Upper bounds on the expected runtime of non-elitist populations from fitness-levels. To appear in Proceedings of The Genetic and Evolutionary Computation Conference (GECCO) 2014, Vancouver, Canada. Google ScholarDigital Library
- Doerr, B., Fouz, M., and Witt, C. (2011). Sharp bounds by probability-generating functions and variable drift. In Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO '11, pages 2083--2090, New York, NY, USA. ACM. Google ScholarDigital Library
- Doerr, B., Johannsen, D., and Winzen, C. (2010a). Multiplicative drift analysis. In Proceedings of the 12th annual conference on Genetic and evolutionary computation, GECCO '10, pages 1449--1456. ACM. Google ScholarDigital Library
- Doerr, B., Johannsen, D., and Winzen, C. (2010b). Multiplicative drift analysis. In GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation, pages 1449--1456, New York, NY, USA. ACM. Google ScholarDigital Library
- Droste, S., Jansen, T., and Wegener, I. (1998). A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with boolean inputs. Evolutionary Computation, 6(2):185--196. Google ScholarDigital Library
- Giel, O. and Wegener, I. (2003). Evolutionary algorithms and the maximum matching problem. In Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), pages 415--426. Google ScholarDigital Library
- Goldberg, D. E. (1989). Genetic Algorithms for Search, Optimization, and Machine Learning. Addison-Wesley. Google ScholarDigital Library
- Hajek, B. (1982). Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability, 13(3):502--525.Google ScholarCross Ref
- He, J. and Yao, X. (2001). Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127(1):57--85. Google ScholarDigital Library
- He, J. and Yao, X. (2004). A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing: an international journal, 3(1):21--35. Google ScholarDigital Library
- Holland, J. H. (1992). Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. The MIT Press. Google ScholarCross Ref
- Jägersküpper, J. (2007). Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theoretical Computer Science, 379(3):329--347. Google ScholarDigital Library
- Jägersküpper, J. (2008). A blend of markov-chain and drift analysis. In PPSN, pages 41--51. Google ScholarDigital Library
- Jansen, T. and Wegener, I. (2001). Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evolutionary Computation, 5(6):589--599. Google ScholarDigital Library
- Johannsen, D. (2010). Random combinatorial structures and randomized search heuristics. PhD thesis, Universität des Saarlandes.Google Scholar
- Lehre, P. K. (2011a). Fitness-levels for non-elitist populations. In Proceedings of the 13th annual conference on Genetic and evolutionary computation, GECCO '11, pages 2075--2082. ACM. Google ScholarDigital Library
- Lehre, P. K. (2011b). Fitness-levels for non-elitist populations. In Proceedings of the 13th annual conference on Genetic and evolutionary computation, (GECCO 2011), pages 2075--2082, New York, NY, USA. ACM. Google ScholarDigital Library
- Lehre, P. K. (2011c). Negative drift in populations. In Proceedings of Parallel Problem Solving from Nature - (PPSN XI), volume 6238 of LNCS, pages 244--253. Springer Berlin / Heidelberg. Google ScholarDigital Library
- Lehre, P. K. and Yao, X. (2012). On the impact of mutation-selection balance on the runtime of evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 16(2):225--241. Google ScholarDigital Library
- Meyn, S. P. and Tweedie, R. L. (1993). Markov Chains and Stochastic Stability. Springer-Verlag.Google ScholarCross Ref
- Mitavskiy, B., Rowe, J. E., and Cannings, C. (2009). Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links. International Journal of Intelligent Computing and Cybernetics, 2(2):243--284.Google ScholarCross Ref
- Motwani, R. and Raghavan, P. (1995). Randomized Algorithms. Cambridge University Press. Google ScholarCross Ref
- Oliveto, P. S. and Witt, C. (2011). Simplified drift analysis for proving lower bounds inevolutionary computation. Algorithmica, 59(3):369--386. Google ScholarDigital Library
- Reeves, C. R. and Rowe, J. E. (2002). Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory. Kluwer Academic Publishers, Norwell, MA, USA. Google ScholarCross Ref
- Rudolph, G. (1998). Finite Markov chain results in evolutionary computation: A tour d'horizon. Fundamenta Informaticae, 35(1--4):67--89. Google ScholarDigital Library
- Sasaki, G. H. and Hajek, B. (1988). The time complexity of maximum matching by simulated annealing. Journal of the Association for Computing Machinery, 35(2):387--403. Google ScholarDigital Library
- Sudholt, D. (2010). General lower bounds for the running time of evolutionary algorithms. In PPSN (1), pages 124--133. Google ScholarDigital Library
- Witt, C. (2006). Runtime analysis of the (μ+1) ea on simple pseudo-boolean functions evolutionary computation. In GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 651--658, New York, NY, USA. ACM Press.Google Scholar
- Witt, C. (2012). Optimizing linear functions with randomized search heuristics - the robustness of mutation. In Dürr, C. and Wilke, T., editors, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), volume 14 of Leibniz International Proceedings in Informatics (LIPIcs), pages 420--431, Dagstuhl, Germany. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.Google Scholar
- Wolpert, D. and Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Trans. Evolutionary Computation, 1(1):67--82. Google ScholarDigital Library
Index Terms
- Runtime Analysis of Evolutionary Algorithms: Basic Introduction
Recommendations
Use of the q-Gaussian mutation in evolutionary algorithms
Special issue on advances in computational intelligence and bioinformaticsThis paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed ...
Population size versus runtime of a simple evolutionary algorithm
Evolutionary algorithms (EAs) find numerous applications, and practical knowledge on EAs is immense. In practice, sophisticated population-based EAs employing selection, mutation and crossover are applied. In contrast, theoretical analysis of EAs often ...
Comments