Performance analysis of randomised search heuristics operating with a fixed budget
DOI10.1016/J.TCS.2013.06.007zbMATH Open1360.68781OpenAlexW2111575001MaRDI QIDQ2250996FDOQ2250996
Authors: 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
Recommendations
- Upper and lower bounds for randomized search heuristics in black-box optimization
- Fixed Budget Performance of the (1+1) EA on Linear Functions
- Fixed-target runtime analysis
- Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
- Tight bounds on the optimization time of a randomized search heuristic on linear functions
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Analysis of algorithms (68W40)
Cites Work
- Title not available (Why is that?)
- Probability and Computing
- Analyzing randomized search heuristics: tools from probability theory
- On the analysis of the \((1+1)\) evolutionary algorithm
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- 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
- Optimizing linear functions with randomized search heuristics -- the robustness of mutation
- Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering
- Title not available (Why is that?)
Cited In (13)
- Optimal parameter choices via precise black-box analysis
- Fixed Budget Performance of the (1+1) EA on Linear Functions
- Working principles of binary differential evolution
- Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas
- Fourier analysis meets runtime analysis: precise runtimes on plateaus
- Fixed-target runtime analysis
- Multiobjective optimization: when objectives exhibit non-uniform latencies
- On easiest functions for mutation operators in bio-inspired optimisation
- Lower bounds from fitness levels made easy
- Average convergence rate of evolutionary algorithms in continuous optimization
- On the impact of the performance metric on efficient algorithm configuration
- A framework for co-optimization algorithm performance and its application to worst-case optimization
- On the effectiveness of immune inspired mutation operators in some discrete optimization problems
This page was built for publication: Performance analysis of randomised search heuristics operating with a fixed budget
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250996)
