On the complexity of overcoming gaps with isotropic mutations and elitist selection

2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings

Volumn 1, Issue , 2005, Pages 206-213

  Jägersküpper, Jens ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; OPTIMIZATION; POLYNOMIALS;

ISOTROPIC MUTATIONS; SEARCH SPACE;

EVOLUTIONARY ALGORITHMS;

EID: 27144507456     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Beyer, H.-G. (2001): The Theory of Evolution Strategies. Springer.
2. Droste, S., Jansen, T., Wegener, I. (2001): Dynamic parameter control in simple evolutionary algorithms. In Foundations of Genetic Algorithms 6 (FOGA 2000), 275-294, Morgan Kaufmann, San Francisco.
3. Droste, S., Jansen, T., Wegener, I. (2002): On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-82.
4. Greenwood, G. W., Zhu, Q. J. (2001): Convergence in evolutionary programs with self-adaptation. Evolutionary Computation, 9(2): 147-157.
5. Hansen, N., Ostermeier, A. (1996): Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation. In Proceedings of the IEEE Int'l Conference on Evolutionary Computation (ICEC), 312-317.
6. Jägersküpper, J. (2003): Analysis of a simple evolutionary algorithm for minimization in Euclidean spaces. In Proceedings of the 30th Int'l Colloquium on Automata, Languages and Programming (ICALP), volume 2719 of LNCS, 1068-1079, Springer.
7. Jägersküpper, J. (2005): Rigorous runtime analysis of the (1+1) ES: 1/5-rule and ellipsoidal fitness landscapes. In Proceedings of Foundations of Genetic Algorithms 8 (FOGA 2005), volume 3469 of LNCS, Springer, to appear.
8. Jägersküpper, J., Witt, C. (2005): Rigorous runtime analysis of a (μ+1) ES for the sphere function. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), ACM, to appear.
9. Liang, K., Yao, X., Newton, C. S. (2001): Adapting self-adaptive parameters in evolutionary algorithms. Applied Intelligence, 15(3):171-180.
10. Mühlenbein, H. (1992): How genetic algorithmis really work: Mutation and hillclimbing. In Parallel Problem Solving from Nature 2 (PPSN), 15-25, North-Holland, Amsterdam.
11. Rechenberg, I. (1973): Evolutionsstrategie. FrommannHolzboog, Stuttgart, Germany.
12. Rudolph, G. (2001): Self-adaptive mutations may lead to premature convergence. IEEE Transactions on Evolutionary Computation, 5(4):410-414.
13. Schwefel, H.-P. (1995): Evolution and Optimum Seeking. Wiley, New York.
14. Yao, X., Liu, Y., Lin, G. (1999): Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation, 3(2):82-102.