37 citations · 140 across the 33 of their papers we have counts for
5 papers · 1 filter
Analysing the Robustness of NSGA-II under Noise
Duc-Cuong Dang, Andre Opris, Bahare Salehi +1
Runtime analysis has produced many results on the efficiency of simple evolutionary algorithms like the (1+1) EA, and its analogue called GSEMO in evolutionary multiobjective optim…
Runtime Analysis of Quality Diversity Algorithms
Jakob Bossek, Dirk Sudholt
Quality diversity~(QD) is a branch of evolutionary computation that gained increasing interest in recent years. The Map-Elites QD approach defines a feature space, i.e., a partitio…
Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima
Joost Jorritsma, Johannes Lengler, Dirk Sudholt
It is an ongoing debate whether and how comma selection in evolutionary algorithms helps to escape local optima. We propose a new benchmark function to investigate the benefits of…
Analysing Equilibrium States for Population Diversity
Johannes Lengler, Andre Opris, Dirk Sudholt
Population diversity is crucial in evolutionary algorithms as it helps with global exploration and facilitates the use of crossover. Despite many runtime analyses showing advantage…
Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation
Duc-Cuong Dang, Andre Opris, Dirk Sudholt
Evolutionary algorithms are popular algorithms for multiobjective optimisation (also called Pareto optimisation) as they use a population to store trade-offs between different obje…