Analyzing different variants of immune inspired somatic contiguous hypermutations

DOI10.1016/J.TCS.2010.09.027zbMath1209.90358OpenAlexW2067996802MaRDI QIDQ627102

Thomas Jansen, Christine Zarges

Publication date: 21 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.027

zbMATH Keywords

runtime analysisartificial immune systemssomatic contiguous hypermutations

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

On easiest functions for mutation operators in bio-inspired optimisation ⋮ A comparative performance analysis of evolutionary algorithms on \(k\)-median and facility location problems ⋮ When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms ⋮ The cost of randomness in evolutionary algorithms: crossover can save random bits ⋮ Black-box search by unbiased variation ⋮ On the effectiveness of immune inspired mutation operators in some discrete optimization problems

Cites Work

• Optimization by Simulated Annealing
• On the analysis of the \((1+1)\) evolutionary algorithm
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Upper and lower bounds for randomized search heuristics in black-box optimization
• On the utility of the population size for inversely fitness proportional mutation rates
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analyzing different variants of immune inspired somatic contiguous hypermutations