When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms

DOI10.1016/j.tcs.2019.03.002zbMath1443.68226arXiv1804.01314OpenAlexW2964348335MaRDI QIDQ2182726

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

Publication date: 26 May 2020

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

Full work available at URL: https://arxiv.org/abs/1804.01314

zbMATH Keywords

evolutionary algorithmsruntime analysisartificial immune systemsageinghypermutationopt-IA

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)

Related Items

When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Lower bounds from fitness levels made easy ⋮ An extended jump functions benchmark for the analysis of randomized search heuristics ⋮ The runtime of the compact genetic algorithm on jump functions ⋮ Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem

Cites Work

• Analyzing evolutionary algorithms. The computer science perspective.
• Analyzing different variants of immune inspired somatic contiguous hypermutations
• On the analysis of the \((1+1)\) evolutionary algorithm
• How to escape local optima in black box optimisation: when non-elitism outperforms elitism
• Towards a runtime comparison of natural and artificial evolution
• On easiest functions for mutation operators in bio-inspired optimisation
• On the utility of the population size for inversely fitness proportional mutation rates
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item