Population size versus runtime of a simple evolutionary algorithm

Theoretical Computer Science

Volumn 403, Issue 1, 2008, Pages 104-120

  Witt, Carsten ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Evolutionary algorithms; Population size; Runtime analysis

Indexed keywords

ELECTRIC NETWORK ANALYSIS; EVOLUTIONARY ALGORITHMS; FUNCTION EVALUATION; LEAD; POLYNOMIAL APPROXIMATION; POPULATION STATISTICS; RISK ASSESSMENT;

(1+1) EVOLUTIONARY ALGORITHMS; (U ,V) OPERATOR; APPLIED (CO); ELSEVIER (CO); NUMEROUS APPLICATIONS; POPULATION SIZES; RUN TIME; SEARCH SPACES; SIMPLE ALGORITHMS;

POLYNOMIALS;

EID: 48149086732     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.05.011     Document Type: Article

References (29)

1. Arnold D.V., and Beyer H.-G. Investigation of the (μ, λ)-ES in the presence of noise. Proceedings of the 2001 Congress on Evolutionary Computation. CEC '01 (2001), IEEE Press 332-339
2. Arnold D.V., and Beyer H.-G. On the benefits of populations for noisy optimization. Evolutionary Computation 11 2 (2003) 111-127
3. Beyer H.-G., Schwefel H.-P., and Wegener I. How to analyse evolutionary algorithms. Theoretical Computer Science 287 1 (2002) 101-130
4. Dietzfelbinger M., Naudts B., van Hoyweghen C., and Wegener I. The analysis of a recombinative hill-climber on H-IFF. IEEE Transactions on Evolutionary Computation 7 (2003) 417-423
5. Droste S., Jansen T., and Wegener I. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276 (2002) 51-81
6. Droste S., Jansen T., and Wegener I. Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems 39 4 (2006) 525-544
7. Eiben A.E., and Rudolph G. Theory of evolutionary algorithms: A bird's eye view. Theoretical Computer Science 229 (1999) 3-9
8. Garnier J., Kallel L., and Schoenauer M. Rigorous hitting times for binary mutations. Evolutionary Computation 7 2 (1999) 173-203
9. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning (1989), Addison Wesley
10. He J., and Yao X. Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artificial Intelligence 145 1-2 (2003) 59-97
11. Jägersküpper J. Analysis of a simple evolutionary algorithm for minimization in Euclidean spaces. Proceedings of the 30th International Colloquium on Automata, Languages, and Programming. ICALP '03. Lecture Notes in Computer Science vol. 2719 (2003), Springer 1068-1079
12. Jägersküpper J. Probabilistic runtime analysis of (1over(,, +) λ) evolution strategies using isotropic mutations. Proceedings of the 2006 Conference on Genetic and Evolutionary Computation. GECCO 2006 (2006), ACM Press 461-468
13. Jägersküpper J., and Witt C. Rigorous runtime analysis of a (μ + 1) ES for the sphere function. Proceedings of the 2005 Conference on Genetic and Evolutionary Computation. GECCO 2005 (2005), ACM Press 849-856
14. Jansen T., De Jong K., and Wegener I. On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation 13 4 (2005) 413-440
15. Jansen T., and Wegener I. On the utility of populations. Proceedings of the Genetic and Evolutionary Computation Conference. GECCO '01 (2001), Morgan Kaufmann 1034-1041
16. Jansen T., and Wegener I. Real royal road functions-where crossover provably is essential. Discrete Applied Mathematics 149 (2005) 111-125
17. Jansen T., and Wiegand R.P. The cooperative coevolutionary (1+1) EA. Evolutionary Computation 12 4 (2004) 405-434
18. Mitchell M., Forrest S., and Holland J.H. The royal road for genetic algorithms: Fitness landscapes and GA performance. Towards a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life (1992), MIT Press, Paris 245-254
19. Mitchell M., Holland J.H., and Forrest S. When will a Genetic Algorithm Outperform Hill Climbing. Advances in Neural Information Processing Systems vol. 6 (1994), Morgan Kaufmann 51-58
20. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press
21. Oliveto P.S., He J., and Yao X. Computational complexity analysis of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing 4 3 (2007) 281-293
22. Schmitt L. Theory of genetic algorithms. Theoretical Computer Science 259 (2001) 1-61
23. Smythe R.T., and Mahmoud H.M. A survey of recursive trees. Theory of Probability and Mathematical Statistics 51 (1995) 1-27
24. Storch T., and Jägersküpper J. How comma selection helps with the escape from local optima. Proceedings of the 2006 Conference on Parallel Problem Solving from Nature. PPSN IX. LNCS vol. 4193 (2006), Springer 52-61
25. Storch T., and Wegener I. Real royal road functions for constant population size. Theoretical Computer Science 320 1 (2004) 123-134
26. Vose M.D. The Simple Genetic Algorithm (1999), MIT Press
27. Wegener I., and Witt C. On the optimization of monotone polynomials by simple randomized search heuristics. Combinatorics, Probability and Computing 14 (2005) 225-247
28. Witt C. Worst-case and average-case approximations by simple randomized search heuristics. Proc. of STACS '05. LNCS vol. 3404 (2005), Springer 44-56
29. Witt C. Runtime analysis of the (μ + 1) EA on simple pseudo-Boolean functions. Evolutionary Computation 14 1 (2006) 65-86