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

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

Dirk Sudholt, Carlo Kneissl

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

evolutionary algorithmstheorycrossoverruntime analysispopulation diversity

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Robustness of populations in stochastic environments
• 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.
• Analyzing different variants of immune inspired somatic contiguous hypermutations
• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• 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
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
• Analysis of noisy evolutionary optimization when sampling fails
• Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
• The Benefit of Recombination in Noisy Evolutionary Search
• Mersenne twister
• Automatic adaptation of hypermutation rates for multimodal optimisation
• Theory of Evolutionary Computation
• Analysis of evolutionary algorithms
• Exact and Efficient Generation of Geometric Random Variates and Random Graphs
• Introduction to evolutionary computing