Theoretical analysis of fitness-proportional selection: Landscapes and efficiency

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 835-842

  Neumann, Frank ^a   Oliveto, Pietro Simone ^b   Witt, Carsten ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Genetic algorithms; Running time analysis; Selection; Theory

Indexed keywords

DRIFT ANALYSIS; FITNESS LANDSCAPE; HIGH PROBABILITY; OBJECTIVE FUNCTIONS; OPTIMAL SOLUTIONS; OPTIMIZATION PROCESS; POLYNOMIAL-TIME; POPULATION SIZES; RUNNING TIME ANALYSIS;

COMPUTATIONAL EFFICIENCY; COMPUTER CRIME; HEALTH; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POPULATION STATISTICS;

EVOLUTIONARY ALGORITHMS;

EID: 72749094467     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1570016     Document Type: Conference Paper

References (10)

1. O. Giel and I. Wegener. Evolutionary algorithms and the maximum matching problem. In Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS '03), pages 415-426. Springer, 2003.
2. D. E. Goldberg. Genetic Algorithms for Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
3. E. Happ, D. Johannsen, C. Klein, and F. Neumann. Rigorous analyses of fitness-proportional selection for optimizing linear functions. In Proc. of GECCO '08, pages 953-960. ACM Press, 2008.
4. J. Holland. Adaptation in Natural and Artificial Systems. Univesity of Michigan Press, 1st edition, 1975.
5. J. Jägersküpper and T. Storch. When the plus strategy outperforms the comma strategy-and when not. In Proceedings of the 2007 IEEE Symposium on Foundations of Computational Intelligence (FOCI 2007), pages 25-32. IEEE Press, 2007.
6. T. Jansen, K. A. De Jong, and I. Wegener. On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation, 13:413-440, 2005.
7. P. S. Oliveto, J. He, and X. Yao. Computational complexity analysis of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing, 4(3):281-293, 2007.
8. P. S. Oliveto and C. Witt. Simplified drift analysis for proving lower bounds in evolutionary computation. In Proc. of Parallel Problem Solving from Nature (PPSN X), volume 5199 of LNCS, pages 82-91. Springer, 2008.
9. I. Wegener and C. Witt. On the optimization of monotone polynomials by simple randomized search heuristics. Combinatorics, Probability and Computing, 14:225-247, 2005.
10. C. Witt. Runtime analysis of the (μ+1) EA on simple pseudo-Boolean functions. Evolutionary Computation, 14(1):65-86, 2006.