Design and Analysis of Diversity-Based Parent Selection Schemes for Speeding Up Evolutionary Multi-objective Optimisation
Not on the map. Why?
Abstract (arXiv)
Parent selection in evolutionary algorithms for multi-objective optimisation is usually performed by dominance mechanisms or indicator functions that prefer non-dominated points. We propose to refine the parent selection on evolutionary multi-objective optimisation with diversity-based metrics. The aim is to focus on individuals with a high diversity contribution located in poorly explored areas of the search space, so the chances of creating new non-dominated individuals are better than in highly populated areas. We show by means of rigorous runtime analysis that the use of diversity-based parent selection mechanisms in the Simple Evolutionary Multi-objective Optimiser (SEMO) and Global SEMO for the well known bi-objective functions rm Osmall NEMsmall INMsmall AX and rm LOTZ can significantly improve their performance. Our theoretical results are accompanied by experimental studies that show a correspondence between theory and empirical results and motivate further theoretical investigations in terms of stagnation. We show that stagnation might occur when favouring individuals with a high diversity contribution in the parent selection step and provide a discussion on which scheme to use for more complex problems based on our theoretical and experimental results.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 May 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 4; 2023: 2; 2024: 1; 2025: 0; 2026: 1.
9 papers.
- 2022A First Runtime Analysis of the NSGA-II on a Multimodal Problemcited by 15
- 2022From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Boundscited by 13
- 2021Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)cited by 8
- 2023Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithmscited by 8
- 2023Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noisecited by 5
- 2022The (1+(λ,λ)) Global SEMO Algorithmcited by 3
- 2024Many Objective Problems Where Crossover is Provably Essentialcited by 3
- 2022Can Evolutionary Clustering Have Theoretical Guarantees?cited by 0
- 2026Parent Selection Mechanisms in Elitist Crossover-Based Algorithmscited by 0
- 2026Parent Selection Mechanisms in Elitist Crossover-Based Algorithms5 Apr 2026
- 2024Many Objective Problems Where Crossover is Provably Essential24 Dec 2024
- 2023Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms5 Jun 2023
- 2023Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise17 May 2023
- 2022Can Evolutionary Clustering Have Theoretical Guarantees?4 Dec 2022
- 2022The (1+(λ,λ)) Global SEMO Algorithm7 Oct 2022
- 2022From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds28 Sep 2022
- 2022A First Runtime Analysis of the NSGA-II on a Multimodal Problem28 Apr 2022
- 2021Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)16 Dec 2021