Optimal fixed and adaptive mutation rates for the LeadingOnes problem

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

Volumn 6238 LNCS, Issue PART 1, 2010, Pages 1-10

  Böttcher, Süntje ^a   Doerr, Benjamin ^a   Neumann, Frank ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE MUTATION; ARTIFICIAL IMMUNE SYSTEM; CLASSICAL PROBLEMS; COMPUTATION TIME; EVOLUTIONARY COMPUTATIONS; EXPECTED OPTIMIZATION TIME; MUTATION PROBABILITY; OPTIMAL MUTATION; PROBLEM SIZE; STANDARD VALUES;

EVOLUTIONARY ALGORITHMS; OPTIMIZATION; PROBABILITY;

PROBLEM SOLVING;

EID: 78149256554     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15844-5_1     Document Type: Conference Paper

References (13)

1. Eiben, A., Smith, J.: Introduction to Evolutionary Computing, 2nd edn. Springer, Heidelberg (2007)
2. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
3. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276, 51-81 (2002)
4. Jansen, T., Wegener, I.: Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evolutionary Computation 5, 589-599 (2001) (Pubitemid 34091917)
5. Oliveto, P.S., He, J., Yao, X.: Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing 4, 281-293 (2007) (Pubitemid 47167355)
6. Doerr, B., Fouz, M., Witt, C.: Quasirandom evolutionary algorithms. In: Proceedings of GECCO 2010. ACM, New York (to appear 2010)
7. Doerr, B., Johannsen, D., Winzen, C.: Drift analysis and linear functions revisited. In: Proceedings of CEC 2010. IEEE, Los Alamitos (to appear 2010)
8. Rudolph, G.: Convergence properties of evolutionary algorithms. Kovac, Hamburg (1997)
9. Witt, C.: Runtime analysis of the (μ+1) EA on simple pseudo-Boolean functions. Evolutionary Computation 14, 65-86 (2006)
10. Neumann, F., Sudholt, D., Witt, C.: Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence 3, 35-68 (2009)
11. Jansen, T., Wegener, I.: On the choice of the mutation probability for the (1+1) EA. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 89-98. Springer, Heidelberg (2000)
12. Zarges, C.: Rigorous runtime analysis of inversely fitness proportional mutation rates. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 112-122. Springer, Heidelberg (2008)
13. Zarges, C.: On the utility of the population size for inversely fitness proportional mutation rates. In: Proceedings of the 10th International Workshop on Foundations of Genetic Algorithms (FOGA 2009), pp. 39-46. ACM, New York (2009)