Comparing global and local mutations on bit strings

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 929-936

  Doerr, Benjamin ^a   Jansen, Thomas ^b   Klein, Christian ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Analysis; Evolutionary computation; Mutation; Randomized local search

Indexed keywords

COMPUTER SCIENCE; EVOLUTIONARY ALGORITHMS;

ANALYSIS; FAVORABLE CONDITIONS; FITNESS FUNCTIONS; GLOBAL APPROACHES; GLOBAL OPERATORS; MUTATION; MUTATION PROBABILITY; RANDOMIZED LOCAL SEARCH;

POLYNOMIAL APPROXIMATION;

EID: 57349178418     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389274     Document Type: Conference Paper

References (10)

1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2. edition, 2001.
2. B. Doerr, E. Happ, and C. Klein. A tight bound for the (1+1)-EA on the single source shortest path problem. In D. Srinivasan and L. Wang, editors, Proceedings of the 2007 IEEE Congress on Evolutionary Computation (CEC), pages 1890-1895. IEEE Press, 2007.
3. S. Droste, T. Jansen, and I. Wegener. On the optimization of unimodal functions with the (1+1) evolutionary algorithm. In A. E. Eiben, T. Back, M. Schoenauer, and H.-P. Schwefel, editors, Proceedings of the 5th International Conference on Parallel Problem Solving From Nature (PPSN), volume 1498 of Lecture Notes in Computer Science, pages 13-22. Springer, 1998.
4. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276(1-2):51-81, 2002.
5. J. He and X. Yao. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3(1):21-35, 2004.
6. J. Horn, D. E. Goldberg, and K. Deb. Long path problems. In Y. Davidor, H.-P. Schwefel, and R. Männer, editors, Proceedings of the Third Conference on Parallel Problem Solving from Nature (PPSN III), volume 866 of Lecture Notes in Computer Science, pages 149-158. Springer, 1994.
7. T. Jansen and I. Wegener. On the choice of the mutation probability for the (1+1) ea. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. M. Guervós, and H.-P. Schwefel, editors, Proceedings of the 6th International Conference on Parallel Problem Solving From Nature (PPSN), volume 1917 of Lecture Notes in Computer Science, pages 89-98. Springer, 2000.
8. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
9. G. Rudolph. How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation, 4(2): 195-205, 1996.
10. G. Rudolph. Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kovač, Hamburg, 1997.