ABSTRACT
Recently Ulrich and Thiele [14] have introduced evolutionary algorithms for the mixed multi-objective problem of maximizing fitness as well as diversity in the decision space. Such an approach allows to generate a diverse set of solutions which are all of good quality. With this paper, we contribute to the theoretical understanding of evolutionary algorithms for maximizing the diversity in a population that contains several solutions of high quality. We study how evolutionary algorithms maximize the diversity of a population where each individual has to have fitness beyond a given threshold value. We present a first runtime analysis in this area and study the classical problems called \emph{\OM} and \emph{\LO}. Our results give first rigorous insights on how evolutionary algorithms can be used to produce a maximal diverse set of solutions in which all solutions have quality above a certain threshold value.
- A. Auger and B. Doerr. Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Co., Inc., 2011. Google ScholarDigital Library
- S. Böttcher, B. Doerr, and F. Neumann. Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In Schaefer et al. {11}, pages 1--10.Google Scholar
- N. Chaiyaratana, T. Piroonratana, and N. Sangkawelert. Effects of diversity control in single-objective and multi-objective genetic algorithms. J. Heuristics, 13(1):1--34, 2007. 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
- T. Friedrich, N. Hebbinghaus, and F. Neumann. Comparison of simple diversity mechanisms on plateau functions. Theor. Comput. Sci., 410(26):2455--2462, 2009. Google ScholarDigital Library
- T. Friedrich, P. S. Oliveto, D. Sudholt, and C. Witt. Analysis of diversity-preserving mechanisms for global exploration. Evolutionary Computation, 17(4):455--476, 2009. Google ScholarDigital Library
- C. Horoba and F. Neumann. Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization. In Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO '08, pages 641--648, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- T. Jansen. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Natural Computing Series. Springer, 2013. Google ScholarDigital Library
- Y. Leung, Y. Gao, and Z. Xu. Degree of population diversity - a perspective on premature convergence in genetic algorithms and its markov chain analysis. IEEE Transactions on Neural Networks, 8(5):1165--1176, 1997. Google ScholarDigital Library
- F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization:Algorithms and Their Computational Complexity. Springer-Verlag New York, Inc., New York, NY, USA, 1st edition, 2010. Google ScholarDigital Library
- R. Schaefer, C. Cotta, J. Kolodziej, and G. Rudolph, editors. Parallel Problem Solving from Nature - PPSN XI, 11th International Conference, Kraków, Poland, September 11-15, 2010, Proceedings, Part I, volume 6238 of Lecture Notes in Computer Science. Springer, 2010. Google ScholarDigital Library
- T. Ulrich, J. Bader, and L. Thiele. Defining and optimizing indicator-based diversity measures in multiobjective search. In Schaefer et al. {11}, pages 707--717. Google ScholarDigital Library
- T. Ulrich, J. Bader, and E. Zitzler. Integrating decision space diversity into hypervolume-based multiobjective search. In M. Pelikan and J. Branke, editors, GECCO, pages 455--462. ACM, 2010. Google ScholarDigital Library
- T. Ulrich and L. Thiele. Maximizing population diversity in single-objective optimization. In N. Krasnogor and P. L. Lanzi, editors, GECCO, pages 641--648. ACM, 2011. Google ScholarDigital Library
- R. K. Ursem. Diversity-guided evolutionary algorithms. In J. J. M. Guervós, P. Adamidis, H.-G. Beyer, J. L. F.-V. Martín, and H.-P. Schwefel, editors, PPSN, volume 2439 of Lecture Notes in Computer Science, pages 462--474. Springer, 2002. Google ScholarDigital Library
- C. Witt. Runtime analysis of the (μ+ 1) EA on simple pseudo-boolean functions. Evolutionary Computation, 14(1):65--86, 2006. Google ScholarDigital Library
Index Terms
- Runtime analysis for maximizing population diversity in single-objective optimization
Recommendations
Maximizing population diversity in single-objective optimization
GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computationTypically, optimization attempts to find a solution which minimizes the given objective function. But often, it might also be useful to obtain a set of structurally very diverse solutions which all have acceptable objective values. With such a set, a ...
Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax
FOGA '23: Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic AlgorithmsThe evolutionary diversity optimization aims at finding a diverse set of solutions which satisfy some constraint on their fitness. In the context of multi-objective optimization this constraint can require solutions to be Pareto-optimal. In this paper ...
Coevolutionary Pareto diversity optimization
GECCO '22: Proceedings of the Genetic and Evolutionary Computation ConferenceComputing diverse sets of high quality solutions for a given optimization problem has become an important topic in recent years. In this paper, we introduce a coevolutionary Pareto Diversity Optimization approach which builds on the success of ...
Comments