Search Results for author:
Found 4 papers, 0 papers with code
Runtime Analysis of Restricted Tournament Selection for Bimodal Optimisation
We prove that RTS finds both optima on ${\rm T{\small WO}M{\small AX}}$ efficiently if the window size $w$ is large enough.
Design and Analysis of Diversity-Based Parent Selection Schemes for Speeding Up Evolutionary Multi-objective Optimisation
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.
Runtime Analysis of Probabilistic Crowding and Restricted Tournament Selection for Bimodal Optimisation
On Twomax probabilistic crowding fails to find any reasonable solution quality even in exponential time.
On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism
Clearing is a niching method inspired by the principle of assigning the available resources among a niche to a single individual.
