On the utility of the population size for inversely fitness proportional mutation rates

DOI10.1145/1527125.1527132zbMath1369.68336OpenAlexW1978453683MaRDI QIDQ5276061

Christine Zarges

Publication date: 14 July 2017

Published in: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms (Search for Journal in Brave)

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

zbMATH Keywords

evolutionary algorithmsruntime analysispopulationsimmune algorithmsmutation operators

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms ⋮ Analyzing different variants of immune inspired somatic contiguous hypermutations ⋮ On benefits and drawbacks of aging strategies for randomized search heuristics ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ From black-box complexity to designing new genetic algorithms ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables ⋮ On the runtime analysis of the simple genetic algorithm ⋮ On the effectiveness of immune inspired mutation operators in some discrete optimization problems

This page was built for publication: On the utility of the population size for inversely fitness proportional mutation rates