When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not

DOI10.1016/j.artint.2022.103804OpenAlexW4301395697MaRDI QIDQ2680763

Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker

Publication date: 4 January 2023

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2022.103804

zbMATH Keywords

metropolistheoryhyper-heuristicsnon-elitismruntime analysismove acceptance operators

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (2)

Choosing the right algorithm with hints from complexity theory ⋮ Lower bounds from fitness levels made easy

Uses Software

• Hyperheuristics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simplified drift analysis for proving lower bounds in evolutionary computation
• Improved time complexity analysis of the simple genetic algorithm
• On the analysis of the \((1+1)\) evolutionary algorithm
• Black-box search by unbiased variation
• When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms
• Recent advances in selection hyper-heuristics
• Stagnation detection with randomized local search
• Multimodal optimization by means of evolutionary algorithms
• Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
• Towards a runtime comparison of natural and artificial evolution
• A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
• On the impact of the performance metric on efficient algorithm configuration
• Black-box Complexity of Parallel Search with Distributed Populations
• Automatic adaptation of hypermutation rates for multimodal optimisation
• Self-adjusting offspring population sizes outperform fixed parameters on the cliff function
• Equation of State Calculations by Fast Computing Machines
• Theory of Evolutionary Computation
• When do evolutionary algorithms optimize separable functions in parallel?
• A runtime analysis of simple hyper-heuristics
• Drift analysis and average time complexity of evolutionary algorithms

This page was built for publication: When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not