Static and self-adjusting mutation strengths for multi-valued decision variables

DOI10.1007/s00453-017-0341-1zbMath1390.68593MaRDI QIDQ1750364

Benjamin Doerr, Carola Doerr, Timo Kötzing

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-0341-1

zbMATH Keywords

genetic algorithms; parameter choice; runtime analysis; theory of randomized search heuristics; parameter control

Mathematics Subject Classification ID

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

Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions, Self-adjusting evolutionary algorithms for multimodal optimization, Runtime analysis for self-adaptive mutation rates

Cites Work

• Unnamed Item
• Unnamed Item
• The impact of random initialization on the runtime of randomized search heuristics
• MMAS versus population-based EA on a family of dynamic fitness functions
• 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.
• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
• Adaptive drift analysis
• Multiplicative drift analysis
• Black-box search by unbiased variation
• Optimal parameter choices via precise black-box analysis
• 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
• (1+1) EA on Generalized Dynamic OneMax
• Oblivious Randomized Direct Search for Real-Parameter Optimization
• Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
• Tight Bounds for Blind Search on the Integers and the Reals
• 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
• Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
• Adaptive population models for offspring populations and parallel evolutionary algorithms
• Foundations of Genetic Algorithms
• Introduction to evolutionary computing
• Drift analysis and average time complexity of evolutionary algorithms