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

We propose a new way to self-adjust the mutation rate in population-based evolutionary algorithms in discrete search spaces. Roughly speaking, it consists of creating half the offspring with a mutation rate that is twice the current mutation rate and the other half with half the current rate. The mu...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 81; no. 2; pp. 593 - 631
Main Authors:	Doerr, Benjamin, Gießen, Christian, Witt, Carsten, Yang, Jing
Format:	Journal Article
Language:	English
Published:	New York Springer US 15.02.2019 Springer Nature B.V Springer Verlag
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Evolutionary algorithms Fitness Genetic algorithms Mathematics of Computing Mutation Optimization Parameters Special Issue on Theory of Genetic and Evolutionary Computation Theory of Computation Yeast Mutation Runtime analysis Self-adaptation Evolutionary computation
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!