The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
From MaRDI portal
Publication:1725645
DOI10.1007/S00453-018-0502-XzbMath1411.68143arXiv1704.02191OpenAlexW2888912300MaRDI QIDQ1725645
Carsten Witt, Benjamin Doerr, Christian Gießen, Jing Yang
Publication date: 14 February 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.02191
Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (15)
Self-adjusting evolutionary algorithms for multimodal optimization ⋮ Runtime analysis for self-adaptive mutation rates ⋮ A tight runtime analysis for the \((\mu + \lambda)\) EA ⋮ Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions ⋮ The cost of randomness in evolutionary algorithms: crossover can save random bits ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ Stagnation detection with randomized local search ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables ⋮ Optimal parameter choices via precise black-box analysis ⋮ Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function ⋮ Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation ⋮ Hardest monotone functions for evolutionary algorithms ⋮ Mutation Rate Control in the $$(1+\lambda )$$ Evolutionary Algorithm with a Self-adjusting Lower Bound
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
- From black-box complexity to designing new genetic algorithms
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Analyzing evolutionary algorithms. The computer science perspective.
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- On the analysis of the \((1+1)\) evolutionary algorithm
- An elementary analysis of the probability that a binomial random variable exceeds its expectation
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
- Solving problems with unknown solution length at almost no extra cost
- Multiplicative drift analysis
- Optimal parameter choices via precise black-box analysis
- The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax
- On the analysis of a dynamic evolutionary algorithm
- Runtime analysis for self-adaptive mutation rates
- Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift
- Black-box Complexity of Parallel Search with Distributed Populations
- (1+1) EA on Generalized Dynamic OneMax
- A Remark on Stirling's Formula
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
- Mean, Median and Mode in Binomial Distributions
- Tight Bounds for Blind Search on the Integers and the Reals
- On the utility of the population size for inversely fitness proportional mutation rates
- Non-uniform mutation rates for problems with unknown solution lengths
- Adaptive population models for offspring populations and parallel evolutionary algorithms
- A runtime analysis of simple hyper-heuristics
- Automata, Languages and Programming
This page was built for publication: The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
