Automatic adaptation of hypermutation rates for multimodal optimisation

DOI10.1145/3450218.3477305OpenAlexW3193427507MaRDI QIDQ5075412

Pietro S. Oliveto, Doğan Çörüş, 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)

Related Items (7)

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

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