Non-uniform mutation rates for problems with unknown solution lengths

DOI10.1145/1967654.1967670zbMath1369.68301OpenAlexW2144894436MaRDI QIDQ5276097

Stephan Cathabard, Per Kristian Lehre, Xin Yao

Publication date: 14 July 2017

Published in: Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1967654.1967670

zbMATH Keywords

mutation operatorruntime analysisunique input-output sequencessearch-based software testingFSM testingvariable-length solutions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

A hybrid mutation chemical reaction optimization algorithm for global numerical optimization ⋮ Black-box search by unbiased variation ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ Solving problems with unknown solution length at almost no extra cost ⋮ The Max problem revisited: the importance of mutation in genetic programming ⋮ The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates

This page was built for publication: Non-uniform mutation rates for problems with unknown solution lengths