On the choice of the mutation probability for the (1+1) EA

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

Volumn 1917, Issue , 2000, Pages 89-98

  Jansen, Thomas ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; OPTIMIZATION;

DYNAMIC MUTATION; FUNCTION OPTIMIZATION; HEURISTIC SEARCH; MUTATION PROBABILITY; NON-TRIVIAL; RUNNING TIME; SEARCH ALGORITHMS;

PROBABILITY;

EID: 84947932163     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45356-3_9     Document Type: Conference Paper

References (11)

1. Bäck, T. (1993). Optimal mutation rates in genetic search. In Forrest, S. (Ed.): Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA '93), 2-8. Morgan Kaufmann.
2. Bäck, T. (1998). An overview of parameter control methods by self-adaptation in evolutionary algorithms. Fundamenta Informaticae 34, 1-15.
3. Droste, S., Jansen, T., and Wegener, I. (1998). A rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with Boolean inputs. Evolutionary Computation 6(2), 185-196.
4. Droste, S., Jansen, T., and Wegener, I. (1998). On the analysis of the (1 + 1) evolutionary algorithm. Tech. Report CI-21/98, Univ. Dortmund, Germany.
5. Gamier, J., Kallel, L. and Schoenauer, M. (1999). Rigorous hitting times for binary mutations. Evolutionary Computation 7(2). 173-203.
6. Hagerup, T., and Rüb, C. (1989). A guided tour of Chernoff bounds. Information Processing Letters 33, 305-308.
7. Jansen, T. and Wegener, I. (1999). On the analysis of evolutionary algorithms — A proof that crossover really can help. In Nesetril, J. (Ed.): Proceedings of the 7th Annual European Symposium on Algorithms (ESA '99), 184-193. Springer.
8. Juels, A. and Wattenberg, M. (1994). Stochastic hillclimbing as a baseline method for evaluating genetic algorithms. Tech. Report CSD-94-834 Univ. of California.
9. Mühlenbein, H. (1992). How Genetic Algorithms Really Work. I. Mutation and Hillclimbing. In Männer, R. and Manderik, R. (Eds.): Parallel Problem Solving From Nature (PPSN II), 15-25. North-Holland.
10. Quick, R. J., Rayward-Smith, V.J., and Smith, G.D. (1998). Fitness distance correlation and ridge functions. In Eiben, A. E. Bäck, T., and Schwefel, H.-P. (Eds.): Parallel Problem Solving from Nature (PPSN V), 77-86. Springer.
11. Rudolph, G. (1997). Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kovač.