On easiest functions for mutation operators in bio-inspired optimisation
From MaRDI portal
Recommendations
- Analyzing different variants of immune inspired somatic contiguous hypermutations
- On the effectiveness of immune inspired mutation operators in some discrete optimization problems
- Optimizing linear functions with randomized search heuristics -- the robustness of mutation
- Tight bounds on the optimization time of a randomized search heuristic on linear functions
- scientific article; zbMATH DE number 2013466
Cites work
- scientific article; zbMATH DE number 1728538 (Why is no real title available?)
- scientific article; zbMATH DE number 2010446 (Why is no real title available?)
- scientific article; zbMATH DE number 2013466 (Why is no real title available?)
- A runtime analysis of simple hyper-heuristics: to mix or not to mix operators
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Analysis of an iterated local search algorithm for vertex coloring
- Analyzing different variants of immune inspired somatic contiguous hypermutations
- Analyzing evolutionary algorithms. The computer science perspective.
- Fixed Budget Performance of the (1+1) EA on Linear Functions
- From black-box complexity to designing new genetic algorithms
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
- Introduction to algorithms
- On the analysis of the \((1+1)\) evolutionary algorithm
- Performance analysis of randomised search heuristics operating with a fixed budget
- Tail bounds on hitting times of randomized search heuristics using variable drift analysis
- The impact of parametrization in memetic evolutionary algorithms
- Theoretical advances in artificial immune systems
- Tight bounds on the optimization time of a randomized search heuristic on linear functions
Cited in
(6)- How to escape local optima in black box optimisation: when non-elitism outperforms elitism
- Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
- OneMax is not the easiest function for fitness improvements
- Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
- Hardest monotone functions for evolutionary algorithms
- When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms
This page was built for publication: On easiest functions for mutation operators in bio-inspired optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2362365)
