How comma selection helps with the escape from local optima

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4193 LNCS, Issue , 2006, Pages 52-61

  Jägersküpper, Jens ^a   Storch, Tobias ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION EVALUATION; GAUSSIAN NOISE (ELECTRONIC); LINEAR EQUATIONS; NUMBER THEORY; OPTIMIZATION;

GAUSSIAN MUTATIONS; LINEAR FUNCTION; SYMMETRIC FUNCTION; THEORETICAL RUNTIME ANALYSIS;

PARALLEL PROCESSING SYSTEMS;

EID: 33750240197     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11844297_6     Document Type: Conference Paper

References (8)

1. Arnold, D. (2002): Noisy Optimization with Evolution Strategies. Springer.
2. Hoeffding, W. (1963): Probability inequalities for sums of bounded random variables. American Statistical Association Journal, 58(301):13-30.
3. Jägersküpper, J. (2003): Analysis of a simple evolutionary algorithm for minimization in Euclidean spaces. In Proc. 30th Int'l Colloquium on Automata, Languages and Programming (ICALP), vol. 2719 of LNCS, 1068-79, Springer.
4. Jägersküpper, J. (2005): On the complexity of overcoming gaps with isotropic mutations and elitist selection. In Proc. 2005 IEEE Congress on Evolutionary Computation (CEC), 206-213, IEEE Press.
5. Jägersküpper, J. (2006): Probabilistic runtime analysis of (1+λ) ES using isotropic mutations. Accepted for the Genetic and Evolutionary Computation Conference (GECCO).
6. Jägersküpper, J., Witt, C. (2005): Rigorous runtime analysis of a (μ+1) ES for the sphere function. In Proc. 2005 Genetic and Evolutionary Computation Conference (GECCO), 849-856, ACM Press.
7. Jansen, T., De Jong, K. A., Wegener, I. (2005): On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation, 13(4):413-440.
8. Schwefel, H.-P. (1995): Evolution and Optimum Seeking. Wiley, New York.