Tobias Friedrich
Nils Hebbinghaus
ABSTRACT
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no rigorous analysis pointing out the use of different mechanisms with respect to the runtime behavior. We consider evolutionary algorithms that differ from each other in the way they ensure diversity and point out situations where the right mechanism is crucial for the success of the algorithm. The algorithms considered either diversify the population with respect to the search points or with respect to function values. Investigating simple plateau functions, we show that using the "right" diversity strategy makes the difference between an exponential and a polynomial runtime.
- N. Chaiyaratana, T. Piroonratana, and N. Sangkawelert. Effects of diversity control in single-objective and argumen-multi-objective genetic algorithms. Journal of Heuristics 13 (1):1--34, 2007. Google Scholar
Digital Library
- B. Doerr, N. Hebbinghaus, and F. Neumann. Speeding up evolutionary algorithms through restricted mutation operators. In Proc. of PPSN'06 volume 4193 of LNCS pages 978--987, 2006. Google ScholarDigital Library
- S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276:51--81, 2002. Google ScholarDigital Library
- O. Giel and I. Wegener. Evolutionary algorithms and the maximum matching problem. In Proc. of STACS'03 volume 2607 of LNCS pages 415--426, 2003. Google ScholarDigital Library
- J. Jägersküpper and T. Storch. How comma selection helps with the escape from local optima. In Proc. of PPSN'06 volume 4193 of LNCS pages 52--61, 2006. Google ScholarDigital Library
- J. Jägersküpper and T. Storch. When the plus strategy outperforms the comma strategy-and when not. In Proc. of FOCI'07 2007.Google ScholarCross Ref
- T. Jansen and I. Wegener. Evolutionary algorithms-on 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. Google ScholarDigital Library
- T. Jansen and I. Wegener. The analysis of evolutionary algorithms-a proof that crossover really can help. Algorithmica 34(1):47--66, 2002.Google ScholarDigital Library
- H. Mühlenbein. How genetic algorithms really work: mutation and hillclimbing. In Proc. of PPSN'92 pages 15--26. Elsevier, 1992.Google Scholar
- F. Neumann. Expected runtimes of evolutionary algorithms for the eulerian cycle problem. In Proc. of CEC'04 volume 1 of IEEE Press pages 904--910, 2004.Google Scholar
- 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, 2004.Google Scholar
- G. Rudolph. How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation 4(2):195--205, 1996. Google ScholarDigital Library
- T. Storch. On the choice of the population size. In Proc. of GECCO'04 volume 3102 of LNCS pages 748--760, 2004.Google Scholar
- D. Sudholt. Crossover is provably essential for the ising modelontrees. In Proc. of GECCO'05 pages 1161--1167. ACM Press, 2005. Google ScholarDigital Library
- R. K. Ursem. Diversity-guided evolutionary algorithms. In Proc. of PPSN'02 volume 2439 of LNCS pages 462--474, 2002. Google ScholarDigital Library
- C. Witt. An analysis of the (µ +1) ea on simple pseudo-boolean functions. In Proc. of GECCO'04 volume 3102 of LNCS pages 761--773, 2004.Google Scholar
- 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, 2005. Google ScholarDigital Library
Index Terms
- Rigorous analyses of simple diversity mechanisms
Recommendations
Comparison of simple diversity mechanisms on plateau functions
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no rigorous analysis pointing out how different diversity mechanisms ...
Theoretical analysis of diversity mechanisms for global exploration
GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computationMaintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to find dissimilar individuals for recombination. We focus on the global ...
Analysis of diversity-preserving mechanisms for global exploration*
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity-preserving mechanisms can enhance global exploration of the search space and enable crossover to find dissimilar individuals for recombination. We focus on the ...
Comments