Population diversity is crucial in evolutionary algorithms to enable global exploration and to avoid poor performance due to premature convergence. This chapter reviews runtime analyses that have shown benefits of population diversity, either through explicit diversity mechanisms or through naturally emerging diversity. These analyses show that the benefits of diversity are manifold: diversity is important for global exploration and the ability to find several global optima. Diversity enhances crossover and enables crossover to be more effective than mutation. Diversity can be crucial in dynamic optimization, when the problem landscape changes over time. And, finally, it facilitates the search for the whole Pareto front in evolutionary multiobjective optimization.
The analyses presented rigorously quantify the performance of evolutionary algorithms in the light of population diversity, laying the foundation for a rigorous understanding of how search dynamics are affected by the presence or absence of population diversity and the use of diversity mechanisms.
This is a preview of subscription content, access via your institution.
Tax calculation will be finalised at checkout
Purchases are for personal use onlyLearn about institutional subscriptions
Unable to display preview. Download preview PDF.
Editors and Affiliations
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Sudholt, D. (2020). The Benefits of Population Diversity in Evolutionary Algorithms: A Survey of Rigorous Runtime Analyses. In: Doerr, B., Neumann, F. (eds) Theory of Evolutionary Computation. Natural Computing Series. Springer, Cham. https://doi.org/10.1007/978-3-030-29414-4_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29413-7
Online ISBN: 978-3-030-29414-4