Runtime Analysis of Probabilistic Crowding and Restricted Tournament Selection for Bimodal Optimisation

03/26/2018
by   Edgar Covantes Osuna, et al.
0

Many real optimisation problems lead to multimodal domains and so require the identification of multiple optima. Niching methods have been developed to maintain the population diversity, to investigate many peaks in parallel and to reduce the effect of genetic drift. Using rigorous runtime analysis, we analyse for the first time two well known niching methods: probabilistic crowding and restricted tournament selection (RTS). We incorporate both methods into a (μ+1) EA on the bimodal function Twomax where the goal is to find two optima at opposite ends of the search space. In probabilistic crowding, the offspring compete with their parents and the survivor is chosen proportionally to its fitness. On Twomax probabilistic crowding fails to find any reasonable solution quality even in exponential time. In RTS the offspring compete against the closest individual amongst w (window size) individuals. We prove that RTS fails if w is too small, leading to exponential times with high probability. However, if w is chosen large enough, it finds both optima for Twomax in time O(μ n n) with high probability. Our theoretical results are accompanied by experimental studies that match the theoretical results and also shed light on parameters not covered by the theoretical results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/17/2022

Runtime Analysis of Restricted Tournament Selection for Bimodal Optimisation

Niching methods have been developed to maintain the population diversity...
research
03/18/2021

On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials is Best

We analyse the impact of the selective pressure for the global optimisat...
research
05/03/2018

Design and Analysis of Diversity-Based Parent Selection Schemes for Speeding Up Evolutionary Multi-objective Optimisation

Parent selection in evolutionary algorithms for multi-objective optimisa...
research
04/17/2019

An Exponential Lower Bound for the Runtime of the cGA on Jump Functions

In the first runtime analysis of an estimation-of-distribution algorithm...
research
03/26/2018

On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism

Clearing is a niching method inspired by the principle of assigning the ...
research
06/07/2023

Analysing the Robustness of NSGA-II under Noise

Runtime analysis has produced many results on the efficiency of simple e...

Please sign up or login with your details

Forgot password? Click here to reset