Static and self-adjusting mutation strengths for multi-valued decision variables
type: Item
instance of: scholarly article
title: Static and self-adjusting mutation strengths for multi-valued decision variables
zbMATH Open document ID: 1390.68593
author: Benjamin Doerr
author: Carola Doerr
author: Timo Kötzing
published in: Algorithmica
publication date: 2018-05-18T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6870387
zbMATH Keywords: theory of randomized search heuristics
zbMATH Keywords: runtime analysis
zbMATH Keywords: genetic algorithms
zbMATH Keywords: parameter choice
zbMATH Keywords: parameter control
MaRDI profile type: Publication
full work available at URL: s00453-017-0341-1
OpenAlex ID: W2733925684
cites work: Q5306039
cites work: Black-box Complexity of Parallel Search with Distributed Populations
cites work: Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
cites work: Multiplicative drift analysis
cites work: Upper and lower bounds for randomized search heuristics in black-box optimization
cites work: Tight Bounds for Blind Search on the Integers and the Reals
cites work: Q3224100
cites work: The impact of random initialization on the runtime of randomized search heuristics
cites work: From black-box complexity to designing new genetic algorithms
cites work: Adaptive drift analysis
cites work: Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
cites work: On the analysis of a dynamic evolutionary algorithm
cites work: Optimal parameter choices via precise black-box analysis
cites work: The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
cites work: Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
cites work: Drift analysis and average time complexity of evolutionary algorithms
cites work: Introduction to evolutionary computing
cites work: Foundations of Genetic Algorithms
cites work: Oblivious Randomized Direct Search for Real-Parameter Optimization
cites work: Analyzing evolutionary algorithms. The computer science perspective.
cites work: (1+1) EA on Generalized Dynamic OneMax
cites work: Adaptive population models for offspring populations and parallel evolutionary algorithms
cites work: Black-box search by unbiased variation
cites work: MMAS versus population-based EA on a family of dynamic fitness functions
cites work: Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
cites work: Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
cites work: The analysis of evolutionary algorithms on sorting and shortest paths problems
cites work: On the utility of the population size for inversely fitness proportional mutation rates
DOI: 10.1007/S00453-017-0341-1
description: scientific article; zbMATH DE number 6870387