research
∙
06/07/2023
Analysing the Robustness of NSGA-II under Noise
Runtime analysis has produced many results on the efficiency of simple e...
share
research
∙
05/30/2023
Runtime Analysis of Quality Diversity Algorithms
Quality diversity (QD) is a branch of evolutionary computation that gain...
research
∙
04/19/2023
Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima
It is an ongoing debate whether and how comma selection in evolutionary ...
research
∙
04/19/2023
Analysing Equilibrium States for Population Diversity
Population diversity is crucial in evolutionary algorithms as it helps w...
research
∙
01/31/2023
A Proof that Using Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation
Evolutionary algorithms are popular algorithms for multiobjective optimi...
research
∙
04/12/2022
Hard Problems are Easier for Success-based Parameter Control
Recent works showed that simple success-based rules for self-adjusting p...
research
∙
04/11/2022
The Compact Genetic Algorithm Struggles on Cliff Functions
The compact genetic algorithm (cGA) is an non-elitist estimation of dist...
research
∙
01/17/2022
Runtime Analysis of Restricted Tournament Selection for Bimodal Optimisation
Niching methods have been developed to maintain the population diversity...
research
∙
05/26/2021
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
We contribute to the theoretical understanding of randomized search heur...
research
∙
04/12/2021
Self-Adjusting Population Sizes for Non-Elitist Evolutionary Algorithms: Why Success Rates Matter
Recent theoretical studies have shown that self-adjusting mechanisms can...
research
∙
07/07/2020
Fast Perturbative Algorithm Configurators
Recent work has shown that the ParamRLS and ParamILS algorithm configura...
research
∙
05/28/2020
More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization
Dynamic optimization problems have gained significant attention in evolu...
research
∙
04/09/2020
Analysis of the Performance of Algorithm Configurators for Search Heuristics with Global Mutation Operators
Recently it has been proved that a simple algorithm configurator called ...
research
∙
04/12/2019
On the Impact of the Cutoff Time on the Performance of Algorithm Configurators
Algorithm configurators are automated methods to optimise the parameters...
research
∙
01/31/2019
Parallel Black-Box Complexity with Tail Bounds
We propose a new black-box complexity model for search algorithms evalua...
research
∙
12/03/2018
Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial
We analyse the performance of well-known evolutionary algorithms (1+1)EA...
research
∙
05/03/2018
Design and Analysis of Diversity-Based Parent Selection Schemes for Speeding Up Evolutionary Multi-objective Optimisation
Parent selection in evolutionary algorithms for multi-objective optimisa...
research
∙
04/17/2018
Memetic Algorithms Beat Evolutionary Algorithms on the Class of Hurdle Problems
Memetic algorithms are popular hybrid search heuristics that integrate l...
research
∙
03/26/2018
Runtime Analysis of Probabilistic Crowding and Restricted Tournament Selection for Bimodal Optimisation
Many real optimisation problems lead to multimodal domains and so requir...
research
∙
03/26/2018
On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism
Clearing is a niching method inspired by the principle of assigning the ...
research
∙
01/30/2018
The Benefits of Population Diversity in Evolutionary Algorithms: A Survey of Rigorous Runtime Analyses
Population diversity is crucial in evolutionary algorithms to enable glo...
research
∙
08/10/2016
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity
Population diversity is essential for avoiding premature convergence in ...
research
∙
07/14/2016
Update Strength in EDAs and ACO: How to Avoid Genetic Drift
We provide a rigorous runtime analysis concerning the update strength, a...
research
∙
04/23/2015
First Steps Towards a Runtime Comparison of Natural and Artificial Evolution
Evolutionary algorithms (EAs) form a popular optimisation paradigm inspi...
research
∙
03/26/2014
How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms
We re-investigate a fundamental question: how effective is crossover in ...
research
∙
06/15/2012
General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms
We present a new method for analyzing the running time of parallel evolu...
research
∙
09/29/2011
Memetic Algorithms: Parametrization and Balancing Local and Global Search
This is a preprint of a book chapter from the Handbook of Memetic Algori...
research
∙
09/08/2011
Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
Evolutionary algorithms are popular heuristics for solving various combi...
research
∙
09/07/2011
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
We present a new method for proving lower bounds on the expected running...
research
∙
10/07/2010
Optimizing Monotone Functions Can Be Difficult
Extending previous analyses on function classes like linear functions, w...
research
∙
07/27/2010