The cost of randomness in evolutionary algorithms: crossover can save random bits

DOI10.1007/978-3-031-30035-6_12OpenAlexW4361798402MaRDI QIDQ6149101FDOQ6149101

Authors: Carlo Kneissl, Dirk Sudholt 

Publication date: 12 January 2024

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30035-6_12

zbMATH Keywords

crossoverevolutionary algorithmstheoryruntime analysispopulation diversity

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27)

Cites Work

• Mersenne twister
• Title not available (Why is that?)
• Robustness of populations in stochastic environments
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Analyzing evolutionary algorithms. The computer science perspective.
• Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization (extended abstract)
• From black-box complexity to designing new genetic algorithms
• Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering
• Analyzing different variants of immune inspired somatic contiguous hypermutations
• Introduction to evolutionary computing
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
• The Benefit of Recombination in Noisy Evolutionary Search
• Exact and efficient generation of geometric random variates and random graphs
• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• Analysis of noisy evolutionary optimization when sampling fails
• Tight bounds on the expected runtime of a standard steady state genetic algorithm
• On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
• Theory of evolutionary computation. Recent developments in discrete optimization
• Automatic adaptation of hypermutation rates for multimodal optimisation

This page was built for publication: The cost of randomness in evolutionary algorithms: crossover can save random bits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149101)