DeepAI AI Chat
Log In Sign Up

Fast Mutation in Crossover-based Algorithms

by   Denis Antipov, et al.

The heavy-tailed mutation operator proposed in Doerr et al. (GECCO 2017), called fast mutation to agree with the previously used language, so far was successfully used only in purely mutation-based algorithms. There, it can relieve the algorithm designer from finding the optimal mutation rate and nevertheless obtain a performance close to the one that the optimal mutation rate gives. In this first runtime analysis of a crossover-based algorithm using a heavy-tailed choice of the mutation rate, we show an even stronger impact. With a heavy-tailed mutation rate, the runtime of the (1+(λ,λ)) genetic algorithm on the OneMax benchmark function becomes linear in the problem size. This is asymptotically faster than with any static mutation rate and is the same asymptotic runtime that can be obtained with a self-adjusting choice of the mutation rate. This result is complemented by an empirical study which shows the effectiveness of the fast mutation also on random MAX-3SAT instances.


page 1

page 2

page 3

page 4


Fast Genetic Algorithms

For genetic algorithms using a bit-string representation of length n, th...

Stagnation Detection meets Fast Mutation

Two mechanisms have recently been proposed that can significantly speed ...

Analysis of Sequence Polymorphism of LINEs and SINEs in Entamoeba histolytica

The goal of this dissertation is to study the sequence polymorphism in r...

The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates

We study unbiased (1+1) evolutionary algorithms on linear functions with...

An information-theoretic evolutionary algorithm

We propose a novel evolutionary algorithm on bit vectors which derives f...

Genetic Algorithms in Time-Dependent Environments

The influence of time-dependent fitnesses on the infinite population dyn...

Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling Salesman Problems

This article analyzes the stochastic runtime of a Cross-Entropy Algorith...