On easiest functions for mutation operators in bio-inspired optimisation

DOI10.1007/s00453-016-0201-4zbMath1366.68257OpenAlexW2507985785WikidataQ59614369 ScholiaQ59614369MaRDI QIDQ2362365

Christine Zarges, Dirk Sudholt, Pietro S. Oliveto, Jun He, Doğan Çörüş, Thomas Jansen

Publication date: 7 July 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-016-0201-4

zbMATH Keywords

evolutionary algorithmstheoryartificial immune systemsrunning time analysishybridisation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms ⋮ OneMax is not the easiest function for fitness improvements ⋮ How to escape local optima in black box optimisation: when non-elitism outperforms elitism ⋮ Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem

Uses Software

• Hyperheuristics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From black-box complexity to designing new genetic algorithms
• Analyzing evolutionary algorithms. The computer science perspective.
• Analyzing different variants of immune inspired somatic contiguous hypermutations
• Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
• The impact of parametrization in memetic evolutionary algorithms
• On the analysis of the \((1+1)\) evolutionary algorithm
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Performance analysis of randomised search heuristics operating with a fixed budget
• Theoretical advances in artificial immune systems
• Fixed Budget Performance of the (1+1) EA on Linear Functions
• Analysis of an Iterated Local Search Algorithm for Vertex Coloring
• Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
• A runtime analysis of simple hyper-heuristics
• Tail bounds on hitting times of randomized search heuristics using variable drift analysis