Automatic adaptation of hypermutation rates for multimodal optimisation

DOI10.1145/3450218.3477305MaRDI QIDQ5075412zbMATH OpenOpenAlexFDO

Authors Doğan Çörüş, Pietro S. Oliveto, Donya Yazdani

Publication date 16 May 2022

Published in Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL http://pure.aber.ac.uk/ws/files/48138530/3450218.3477305.pdf

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cited in

(8)

• The cost of randomness in evolutionary algorithms: crossover can save random bits
• Tight runtime bounds for static unary unbiased evolutionary algorithms on linear functions
• Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution
• Runtime analysis for permutation-based evolutionary algorithms
• Choosing the right algorithm with hints from complexity theory
• When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not
• Stagnation detection meets fast mutation
• Stagnation detection meets fast mutation

This page was built for publication: Automatic adaptation of hypermutation rates for multimodal optimisation

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