Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
From MaRDI portal
Publication:1750362
DOI10.1007/s00453-017-0354-9zbMath1391.68100MaRDI QIDQ1750362
Publication date: 18 May 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0354-9
genetic algorithms; parameter choice; runtime analysis; theory of randomized search heuristics; parameter control
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
90C59: Approximation methods and heuristics in mathematical programming
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68W20: Randomized algorithms
Related Items
An Experimental Study of Operator Choices in the $$(1+(\lambda ,\lambda ))$$ Genetic Algorithm, The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm, Upper tail analysis of bucket sort and random tries, Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions, Solving problems with unknown solution length at almost no extra cost, Island models meet rumor spreading, Generalized framework for group testing: queries, feedbacks and adversaries, A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions, Self-adjusting evolutionary algorithms for multimodal optimization, Fast mutation in crossover-based algorithms, Stagnation detection with randomized local search, Multiplicative up-drift, Self-adjusting mutation rates with provably optimal success rules, Analyzing randomized search heuristics via stochastic domination, Runtime analysis for self-adaptive mutation rates, A tight runtime analysis for the \((\mu + \lambda)\) EA
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Crossover can provably be useful in evolutionary computation
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
- From black-box complexity to designing new genetic algorithms
- Analyzing evolutionary algorithms. The computer science perspective.
- On the analysis of the \((1+1)\) evolutionary algorithm
- Learning probability distributions in continuous evolutionary algorithms -- a comparative review
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- More effective crossover operators for the all-pairs shortest path problem
- Adaptive drift analysis
- Multiplicative drift analysis
- Black-box search by unbiased variation
- Fitness levels with tail bounds for the analysis of randomized search heuristics
- Upper and lower bounds for randomized search heuristics in black-box optimization
- On the analysis of a dynamic evolutionary algorithm
- Black-box Complexity of Parallel Search with Distributed Populations
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
- On the utility of the population size for inversely fitness proportional mutation rates
- Black-box search by elimination of fitness functions
- Faster black-box algorithms through higher arity operators
- Adaptive population models for offspring populations and parallel evolutionary algorithms
- Foundations of Genetic Algorithms
- Automata, Languages and Programming
- Introduction to evolutionary computing
- Drift analysis and average time complexity of evolutionary algorithms
