A runtime analysis of simple hyper-heuristics
From MaRDI portal
Publication:5276117
DOI10.1145/2460239.2460249zbMath1369.68317OpenAlexW2056433610MaRDI QIDQ5276117
Ender Özcan, Per Kristian Lehre
Publication date: 14 July 2017
Published in: Proceedings of the twelfth workshop on Foundations of genetic algorithms XII (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2460239.2460249
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
On easiest functions for mutation operators in bio-inspired optimisation ⋮ An iterated multi-stage selection hyper-heuristic ⋮ Fast machine reassignment ⋮ Recent advances in selection hyper-heuristics ⋮ Selection hyper-heuristics for the multi and many-objective quadratic assignment problem ⋮ When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
