research
∙
07/03/2023
First Steps towards a Runtime Analysis of Neuroevolution
We consider a simple setting in neuroevolution where an evolutionary alg...
share
research
∙
05/11/2023
Fast Pareto Optimization Using Sliding Window Selection
Pareto optimization using evolutionary multi-objective algorithms has be...
research
∙
04/21/2023
How Well Does the Metropolis Algorithm Cope With Local Optima?
The Metropolis algorithm (MA) is a classic stochastic local search heuri...
research
∙
04/18/2023
3-Objective Pareto Optimization for Problems with Chance Constraints
Evolutionary multi-objective algorithms have successfully been used in t...
research
∙
08/11/2022
Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions
Linear functions play a key role in the runtime analysis of evolutionary...
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
∙
04/05/2022
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem
We prove that Simulated Annealing with an appropriate cooling schedule c...
research
∙
09/13/2021
Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables
Chance constrained optimization problems allow to model problems where c...
research
∙
04/09/2021
Stagnation Detection in Highly Multimodal Fitness Landscapes
Stagnation detection has been proposed as a mechanism for randomized sea...
research
∙
03/18/2021
On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials is Best
We analyse the impact of the selective pressure for the global optimisat...
research
∙
01/28/2021
Stagnation Detection with Randomized Local Search
Recently a mechanism called stagnation detection was proposed that autom...
research
∙
10/21/2020
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint
In the last decade remarkable progress has been made in development of s...
research
∙
06/16/2020
Evolutionary Algorithms with Self-adjusting Asymmetric Mutation
Evolutionary Algorithms (EAs) and other randomized search heuristics are...
research
∙
06/12/2020
Improved Fixed-Budget Results via Drift Analysis
Fixed-budget theory is concerned with computing or bounding the fitness ...
research
∙
04/07/2020
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization
Recent theoretical research has shown that self-adjusting and self-adapt...
research
∙
06/21/2019
Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools
The expected running time of the classical (1+1) EA on the OneMax benchm...
research
∙
11/30/2018
Runtime Analysis for Self-adaptive Mutation Rates
We propose and analyze a self-adaptive version of the (1,λ) evolutionary...
research
∙
06/14/2018
Theory of Estimation-of-Distribution Algorithms
Estimation-of-distribution algorithms (EDAs) are general metaheuristics ...
research
∙
04/07/2017
The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate
We propose a new way to self-adjust the mutation rate in population-base...
research
∙
03/31/2017
Upper Bounds on the Runtime of the Univariate Marginal Distribution Algorithm on OneMax
A runtime analysis of the Univariate Marginal Distribution Algorithm (UM...
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
On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling
Evolutionary algorithms have been frequently used for dynamic optimizati...
research
∙
07/16/2013
The Fitness Level Method with Tail Bounds
The fitness-level method, also called the method of f-based partitions, ...
research
∙
07/09/2013
General Drift Analysis with Tail Bounds
Drift analysis is one of the state-of-the-art techniques for the runtime...
research
∙
11/30/2012
Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
This erratum points out an error in the simplified drift theorem (SDT) [...
research
∙
08/22/2011
Tight Bounds on the Optimization Time of the (1+1) EA on Linear Functions
The analysis of randomized search heuristics on classes of functions is ...
research
∙
05/27/2011
