Stagnation Detection meets Fast Mutation

01/28/2022
by   Benjamin Doerr, et al.
0

Two mechanisms have recently been proposed that can significantly speed up finding distant improving solutions via mutation, namely using a random mutation rate drawn from a heavy-tailed distribution ("fast mutation", Doerr et al. (2017)) and increasing the mutation strength based on stagnation detection (Rajabi and Witt (2020)). Whereas the latter can obtain the asymptotically best probability of finding a single desired solution in a given distance, the former is more robust and performs much better when many improving solutions in some distance exist. In this work, we propose a mutation strategy that combines ideas of both mechanisms. We show that it can also obtain the best possible probability of finding a single distant solution. However, when several improving solutions exist, it can outperform both the stagnation-detection approach and fast mutation. The new operator is more than an interleaving of the two previous mechanisms and it also outperforms any such interleaving.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/14/2020

Fast Mutation in Crossover-based Algorithms

The heavy-tailed mutation operator proposed in Doerr et al. (GECCO 2017)...
research
01/22/2018

Improving TSP Solutions Using GA with a New Hybrid Mutation Based on Knowledge and Randomness

Genetic algorithm (GA) is an efficient tool for solving optimization pro...
research
03/09/2017

Fast Genetic Algorithms

For genetic algorithms using a bit-string representation of length n, th...
research
12/07/2011

Pure Strategy or Mixed Strategy?

Mixed strategy EAs aim to integrate several mutation operators into a si...
research
01/09/2018

Novel Methods for Enhancing the Performance of Genetic Algorithms

In this thesis we propose new methods for crossover operator namely: cut...
research
05/21/2013

Improving NSGA-II with an Adaptive Mutation Operator

The performance of a Multiobjective Evolutionary Algorithm (MOEA) is cru...
research
08/23/2022

A multiplicity-preserving crossover operator on graphs. Extended version

Evolutionary algorithms usually explore a search space of solutions by m...

Please sign up or login with your details

Forgot password? Click here to reset