Evolutionary Algorithms with Self-adjusting Asymmetric Mutation

06/16/2020
by   Amirhossein Rajabi, et al.
0

Evolutionary Algorithms (EAs) and other randomized search heuristics are often considered as unbiased algorithms that are invariant with respect to different transformations of the underlying search space. However, if a certain amount of domain knowledge is available the use of biased search operators in EAs becomes viable. We consider a simple (1+1) EA for binary search spaces and analyze an asymmetric mutation operator that can treat zero- and one-bits differently. This operator extends previous work by Jansen and Sudholt (ECJ 18(1), 2010) by allowing the operator asymmetry to vary according to the success rate of the algorithm. Using a self-adjusting scheme that learns an appropriate degree of asymmetry, we show improved runtime results on the class of functions OneMax_a describing the number of matching bits with a fixed target a∈{0,1}^n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/07/2020

Self-Adjusting Evolutionary Algorithms for Multimodal Optimization

Recent theoretical research has shown that self-adjusting and self-adapt...
research
04/07/2017

The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate

We propose a new way to self-adjust the mutation rate in population-base...
research
05/28/2018

Randomized Local Search Heuristics for Submodular Maximization and Covering Problems: Benefits of Heavy-tailed Mutation Operators

A core feature of evolutionary algorithms is their mutation operator. Re...
research
01/17/2019

Interpolating Local and Global Search by Controlling the Variance of Standard Bit Mutation

A key property underlying the success of evolutionary algorithms (EAs) i...
research
08/23/2022

A multiplicity-preserving crossover operator on graphs. Extended version

Evolutionary algorithms usually explore a search space of solutions by m...
research
06/05/2023

Representation-agnostic distance-driven perturbation for optimizing ill-conditioned problems

Locality is a crucial property for efficiently optimising black-box prob...
research
06/22/2020

First Steps Towards a Runtime Analysis When Starting With a Good Solution

The mathematical runtime analysis of evolutionary algorithms traditional...

Please sign up or login with your details

Forgot password? Click here to reset