The First Mathematical Proof That Crossover Gives Super-Constant Performance Gains For the NSGA-II

08/18/2022
by   Benjamin Doerr, et al.
0

Very recently, the first mathematical runtime analyses for the NSGA-II, the most common multi-objective evolutionary algorithm, have been conducted (Zheng, Liu, Doerr (AAAI 2022)). Continuing this research direction, we prove that the NSGA-II optimizes the OneJumpZeroJump benchmark asymptotically faster when crossover is employed. This is the first time such an advantage of crossover is proven for the NSGA-II. Our arguments can be transferred to single-objective optimization. They then prove that crossover can speed-up the (μ+1) genetic algorithm in a different way and more pronounced than known before. Our experiments confirm the added value of crossover and show that the observed speed-ups are even larger than what our proofs can guarantee.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/07/2022

The (1+(λ,λ)) Global SEMO Algorithm

The (1+(λ,λ)) genetic algorithm is a recently proposed single-objective ...
research
12/16/2021

A First Mathematical Runtime Analysis of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)

The non-dominated sorting genetic algorithm II (NSGA-II) is the most int...
research
04/28/2022

A First Runtime Analysis of the NSGA-II on a Multimodal Problem

Very recently, the first mathematical runtime analyses of the multi-obje...
research
11/30/2018

Improved Crowding Distance for NSGA-II

Non-dominated sorting genetic algorithm II (NSGA-II) does well in dealin...
research
08/09/2018

Fuzzy Clustering to Identify Clusters at Different Levels of Fuzziness: An Evolutionary Multi-Objective Optimization Approach

Fuzzy clustering methods identify naturally occurring clusters in a data...
research
07/10/2018

Significance-based Estimation-of-Distribution Algorithms

Estimation-of-distribution algorithms (EDAs) are randomized search heuri...

Please sign up or login with your details

Forgot password? Click here to reset