Performance analysis of randomised search heuristics operating with a fixed budget
From MaRDI portal
Publication:2250996
DOI10.1016/J.TCS.2013.06.007zbMath1360.68781OpenAlexW2111575001MaRDI QIDQ2250996
Christine Zarges, Thomas Jansen
Publication date: 10 July 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.06.007
Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Related Items (11)
Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas ⋮ On easiest functions for mutation operators in bio-inspired optimisation ⋮ Fixed-target runtime analysis ⋮ Multiobjective optimization: when objectives exhibit non-uniform latencies ⋮ On the impact of the performance metric on efficient algorithm configuration ⋮ Average convergence rate of evolutionary algorithms in continuous optimization ⋮ Lower bounds from fitness levels made easy ⋮ A framework for co-optimization algorithm performance and its application to worst-case optimization ⋮ Optimal parameter choices via precise black-box analysis ⋮ Working principles of binary differential evolution ⋮ On the effectiveness of immune inspired mutation operators in some discrete optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the approximation ability of evolutionary optimization with application to minimum set cover
- Runtime analysis of the 1-ANT ant colony optimizer
- Runtime analysis of a binary particle swarm optimizer
- On the analysis of the \((1+1)\) evolutionary algorithm
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- Analysis of evolutionary algorithms
- Probability and Computing
This page was built for publication: Performance analysis of randomised search heuristics operating with a fixed budget
