On the impact of the mutation-selection balance on the runtime of evolutionary algorithms

Proceedings of the 10th ACM SIGEVO Workshop on Foundations of Genetic Algorithms, FOGA'09

Volumn , Issue , 2009, Pages 47-58

  Lehre, Per Kristian ^a   Yao, Xin ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Branching processes; Evolutionary algorithms; Runtime analysis

Indexed keywords

BRANCHING PROCESS; BRANCHING PROCESSES; FITNESS FUNCTIONS; LINEAR RANKING; MUTATION OPERATORS; MUTATION RATES; OPTIMAL BALANCE; OPTIMAL SOLUTIONS; PARAMETER CHOICE; POLYNOMIAL-TIME; PROBLEM INSTANCES; RUNTIME ANALYSIS; RUNTIMES; SELECTION MECHANISM; SELECTION PRESSURES;

FUNCTION EVALUATION; MATHEMATICAL OPERATORS; POLYNOMIAL APPROXIMATION;

EVOLUTIONARY ALGORITHMS;

EID: 70349128450     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1527125.1527133     Document Type: Conference Paper

References (18)

1. Thomas Bäck. Selective pressure in evolutionary algorithms: A characterization of selection mechanisms. In Proceedings of the 1st IEEE Conf. on Evolutionary Computation, pages 57-62. IEEE Press, 1994.
2. Tobias Blickle and Lothar Thiele. A comparison of selection schemes used in evolutionary algorithms. Evolutionary Computation, 4(4):361-394, 1996.
3. Erick Cantu-Paz. Order statistics and selection methods of evolutionary algorithms. Information Processing Letters, 82(1):15-22, 2002.
4. Tianshi Chen, Jun He, Guangzhong Sun, Guoliang Chen, and Xin Yao. A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 2009. To appear.
5. Stefan Droste, Thomas Jansen, and Ingo Wegener. On the analysis of the (1+1) Evolutionary Algorithm. Theoretical Computer Science, 276:51-81, 2002.
6. Agoston E. Eiben and C. A. Schippers. On evolutionary exploration and exploitation. Fundam. Inf., 35(1-4):35-50, 1998.
7. David E. Goldberg and Kalyanmoy Deb. A comparative analysis of selection schemes used in genetic algorithms. In Foundations of Genetic Algorithms, pages 69-93. Morgan Kaufmann, 1991.
8. Patsy Haccou, Peter Jagers, and Vladimir Vatutin. Branching Processes: Variation, Growth, and Extinction of Populations. Cambridge Studies in Adaptive Dynamics. Cambridge University Press, 2005.
9. Edda Happ, Daniel Johannsen, Christian Klein, and Frank Neumann. Rigorous analyses of fitness-proportional selection for optimizing linear functions. In GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pages 953-960, New York, NY, USA, 2008. ACM.
10. Jun He and Xin Yao. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3(1):21-35, 2004.
11. Jens Jägersküpper and Carsten Witt. Rigorous runtime analysis of a (μ+1) ES for the sphere function. In GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation, pages 849-856, New York, NY, USA, 2005. ACM.
12. Tatsuya Motoki. Calculating the expected loss of diversity of selection schemes. Evolutionary Computation, 10(4):397-422, 2002.
13. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
14. Ruhul Sarker, Masoud Mohammadian, and Xin Yao, editors. Evolutionary Optimization. Kluwer Academic Publishers, 2002.
15. Dirk Schlierkamp-Voosen. Predictive models for the breeder genetic algorithm. Evolutionary Computation, 1:25-49, 1993.
16. Darrell Whitley. The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA, 1989. Morgan Kaufman.
17. Carsten Witt. Runtime Analysis of the (μ + 1) EA on Simple Pseudo-Boolean Functions. Evolutionary Computation, 14(1):65-86, 2006.
18. Carsten Witt. Population size versus runtime of a simple evolutionary algorithm. Theoretical Computer-Science, 403(1):104-120, 2008.