A rigorous view on neutrality

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 2591-2597

  Doerr, Benjamin ^a   Gnewuch, Michael ^b   Hebbinghaus, Nils ^a   Neumann, Frank ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FITNESS FUNCTION; NEUTRALITY; RUNTIME ANALYSIS;

COMPUTATIONAL EFFICIENCY; EVOLUTIONARY ALGORITHMS; FUNCTION EVALUATION; MATHEMATICAL MODELS;

ENCODING (SYMBOLS);

EID: 77955913917     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4424797     Document Type: Conference Paper

References (21)

1. M. Collins. Finding needles in haystacks is harder with neutrality. In Proc. of GECCO '05, pages 1613-1618. ACM Press, 2005.
2. S. Droste. Analysis of the (1+1) ea for a dynamically bitwise changing onemax. In Proc. of GECCO '03, volume 2724 of LNCS, pages 909-921. Springer, 2003.
3. S. Droste. Not all linear functions are equally difficult for the compact genetic algorithm. In Proc. of GECCO '05, pages 679-686. ACM, 2005.
4. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci., 276:51-81, 2002.
5. E. Galván-López and R. Poli. An empirical investigation of how and why neutrality affects evolutionary search. In Proc. of GECCO '06, pages 1149-1156. ACM Press, 2006.
6. E. Galván-López and R. Poli. Some steps towards understanding how neutrality affects evolutionary search. In Proc. of PPSN '06, volume 4193 of LNCS, pages 778-787, 2006.
7. O. Giel and I. Wegener. Evolutionary algorithms and the maximum matching problem. In Proc. of STACS '03, volume 2607 of LNCS, pages 415-426. Springer, 2003.
8. T. Jansen and I. Wegener. Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evolutionary Computation, 5(6):589-599, 2001.
9. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
10. H. Mühlenbein. How genetic algorithms really work: mutation and hillclimbing. In Proc. of PPSN '92, pages 15-26. Elsevier, 1992.
11. F. Neumann and I. Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. In Proc. of GECCO '04, volume 3102 of LNCS, pages 713-724. Springer, 2004.
12. F. Neumann and C. Witt. Runtime analysis of a simple ant colony optimization algorithm. In Proc. of ISAAC '06, volume 4288 of LNCS, pages 618-627. Springer, 2006.
13. I. Pak and V. H. Vu. On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes. Discrete Applied Mathematics, 110 (2-3):251-272, 2001.
14. A. M. Raich and J. Ghaboussi. Implicit representation in genetic algorithms using redundancy. Evolutionary Computation, 2(2):277-302, 1997.
15. F. Rothlauf. Population sizing for the redundant trivial voting mapping. In Proc. of GECCO '03, volume 2724 of LNCS, pages 618-627. Springer, 2003.
16. G. Rudolph. How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation, 4(2):195-205, 1996.
17. T. Storch. On the choice of the population size. In Proc. of GECCO '04, volume 3102 of LNCS, pages 748-760. Springer, 2004.
18. M. Toussaint and C. Igel. Neutrality and self-adaptation. Natural Computing, 2(2):117-132, 2003.
19. K. Weicker and N. Weicker. Burden and benefits of redundancy. In Proc. of FOGA '00, pages 313-333. Morgan Kaufmann, 2001.
20. C. Witt. An analysis of the (μ+1) ea on simple pseudoboolean functions. In Proc. of GECCO '04, volume 3102 of LNCS, pages 761-773. Springer, 2004.
21. C. Witt. Worst-case and average-case approximations by simple randomized search heuristics. In Proc. of STACS '05, volume 3404 of LNCS, pages 44-56. Springer, 2005.