Optimizing monotone functions can be difficult

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 42-51

  Doerr, Benjamin ^a   Jansen, Thomas ^b   Sudholt, Dirk ^c   Winzen, Carola ^a   Zarges, Christine ^d  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY COLLEGE CORK   (Ireland)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^d TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT FACTORS; FUNCTION CLASS; LINEAR FUNCTIONS; MONOTONE FUNCTIONS; MUTATION PROBABILITY; PSEUDO-BOOLEAN FUNCTION; RUNTIMES; UPPER BOUND;

OPTIMIZATION; PROBABILITY; PROBLEM SOLVING;

BOOLEAN FUNCTIONS;

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

References (20)

1. Mühlenbein, H.: How genetic algorithms really work. Mutation and hillclimbing. In: Proceedings of PPSN II, pp. 15-25. North-Holland, Amsterdam (1992)
2. Droste, S., Jansen, T., Wegener, I.: On the optimization of unimodal functions with the (1+1) evolutionary algorithm. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 13-22. Springer, Heidelberg (1998)
3. Horn, J., Goldberg, D., Deb, K.: Long path problems. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 149-158. Springer, Heidelberg (1994)
4. Igel, C., Toussaint, M.: A no-free-lunch theorem for non-uniform distributions of target functions. J. of Mathematical Modelling and Algorithms 3, 313-322 (2004) (Pubitemid 40317581)
5. Oliveto, P., 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
6. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276, 51-81 (2002)
7. He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127, 57-85 (2001)
8. He, J., Yao, X.: Erratum to [7]. Artificial Intelligence 140, 245-248 (2002)
9. Jägersküpper, J.: A blend of Markov-chain and drift analysis. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 41-51. Springer, Heidelberg (2008)
10. Doerr, B., Fouz, M., Witt, C.: Quasirandom evolutionary algorithms. In: Proceedings of GECCO 2010, pp. 1457-1464. ACM, New York (2010)
11. Doerr, B., Johannsen, D., Winzen, C.: Drift analysis and linear functions revisited. In: Proceedings of CEC 2010, pp. 1967-1974. IEEE, Los Alamitos (2010)
12. Doerr, B., Goldberg, L.: Adaptive drift analysis. In: Schaefer, R., et al. (eds.) PPSN XI, Part I. LNCS, vol. 6238, pp. 32-41. Springer, Heidelberg (2010)
13. 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)
14. Bäck, T., Fogel, D., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. Oxford University Press, Oxford (1997)
15. Ochoa, G.: Setting the mutation rate: Scope and limitations of the 1/L heuristic. In: Proceedings of GECCO 2002, pp. 495-502. Morgan Kaufmann, San Francisco (2002)
16. Cervantes, J., Stephens, C.R.: Limitations of existing mutation rate heuristics and how a rank GA overcomes them. IEEE Trans. on Evol. Comp. 13, 369-397 (2009)
17. Jansen, T.: On the brittleness of evolutionary algorithms. In: Stephens, C.R., Toussaint, M., Whitley, L.D., Stadler, P.F. (eds.) FOGA 2007. LNCS, vol. 4436, pp. 54-69. Springer, Heidelberg (2007)
18. Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, Chichester (2000)
19. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)
20. Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. Algorithmica (2010), http://dx.doi.org/10. 1007/s00453-010-9387-z