Mutation rate control in the (1+) evolutionary algorithm with a self-adjusting lower bound

DOI10.1007/978-3-030-58657-7_25zbMATH Open1460.90208OpenAlexW3086777712MaRDI QIDQ4965121FDOQ4965121

Authors: Kirill Antonov, Arina Buzdalova, Carola Doerr 

Publication date: 25 February 2021

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://hal.sorbonne-universite.fr/hal-02948754/file/main.pdf

Recommendations

• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• Runtime analysis for self-adaptive mutation rates
• Self-adjusting mutation rates with provably optimal success rules
• Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm

zbMATH Keywords

metaheuristicalgorithm configurationevolutionary computationmutation rateparameter setting

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Title not available (Why is that?)
• Black-box search by unbiased variation
• Introduction to evolutionary computing
• The query complexity of a permutation-based variant of mastermind
• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• Theory of evolutionary computation. Recent developments in discrete optimization

Cited In (3)

• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• Runtime analysis for self-adaptive mutation rates
• Self-adjusting mutation rates with provably optimal success rules

Uses Software

• IOHprofiler
• GitHub

This page was built for publication: Mutation rate control in the \((1+\lambda)\) evolutionary algorithm with a self-adjusting lower bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965121)