The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax

DOI10.1007/s00453-016-0214-zzbMath1366.68262OpenAlexW2520275545WikidataQ57200558 ScholiaQ57200558MaRDI QIDQ2362360

Christian Gießen, Carsten Witt

Publication date: 7 July 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/f07194ac-0293-44c3-9464-6255746497fa

zbMATH Keywords

mutationruntime analysispopulations

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Does comma selection help to cope with local optima?, Fast mutation in crossover-based algorithms, Runtime analysis for self-adaptive mutation rates, A tight runtime analysis for the \((\mu + \lambda)\) EA, Lower bounds from fitness levels made easy, An extended jump functions benchmark for the analysis of randomized search heuristics, The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate, The runtime of the compact genetic algorithm on jump functions, Optimal parameter choices via precise black-box analysis

Cites Work

• Unnamed Item
• Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Analyzing evolutionary algorithms. The computer science perspective.
• Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded
• Adaptive drift analysis
• Multiplicative drift analysis
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
• Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift
• Black-box Complexity of Parallel Search with Distributed Populations
• Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
• Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions