research
∙
05/26/2023
Non-Elitist Evolutionary Multi-Objective Optimisation: Proof-of-Principle Results
Elitism, which constructs the new population by preserving best solution...
share
research
∙
06/30/2022
Runtime Analysis of Competitive co-Evolutionary Algorithms for Maximin Optimisation of a Bilinear Function
Co-evolutionary algorithms have a wide range of applications, such as in...
research
∙
04/01/2020
Self-adaptation in non-Elitist Evolutionary Algorithms on Discrete Problems with Unknown Structure
A key challenge to make effective use of evolutionary algorithms is to c...
research
∙
08/23/2019
Runtime Analysis of Fitness-Proportionate Selection on Linear Functions
This paper extends the runtime analysis of non-elitist evolutionary algo...
research
∙
07/29/2019
On the Limitations of the Univariate Marginal Distribution Algorithm to Deception and Where Bivariate EDAs might help
We introduce a new benchmark problem called Deceptive Leading Blocks (DL...
research
∙
04/19/2019
Runtime Analysis of the Univariate Marginal Distribution Algorithm under Low Selective Pressure and Prior Noise
We perform a rigorous runtime analysis for the Univariate Marginal Distr...
research
∙
01/31/2019
Parallel Black-Box Complexity with Tail Bounds
We propose a new black-box complexity model for search algorithms evalua...
research
∙
07/26/2018
Level-Based Analysis of the Univariate Marginal Distribution Algorithm
Estimation of Distribution Algorithms (EDAs) are stochastic heuristics t...
research
∙
06/05/2018
Level-Based Analysis of the Population-Based Incremental Learning Algorithm
The Population-Based Incremental Learning (PBIL) algorithm uses a convex...
research
∙
02/02/2018
Improved Runtime Bounds for the Univariate Marginal Distribution Algorithm via Anti-Concentration
Unlike traditional evolutionary algorithms which produce offspring via g...
research
∙
09/04/2017
Theoretical Analysis of Stochastic Search Algorithms
Theoretical analyses of stochastic search algorithms, albeit few, have a...
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/12/2016
Populations can be essential in tracking dynamic optima
Real-world optimisation problems are often dynamic. Previously good solu...
research
∙
06/17/2016
Self-adaptation of Mutation Rates in Non-elitist Populations
The runtime of evolutionary algorithms (EAs) depends critically on their...
research
∙
12/07/2015
Level-Based Analysis of Genetic Algorithms for Combinatorial Optimization
The paper is devoted to upper bounds on run-time of Non-Elitist Genetic ...
research
∙
07/29/2014
Level-based Analysis of Genetic Algorithms and other Search Processes
Understanding how the time-complexity of evolutionary algorithms (EAs) d...
research
∙
01/09/2014
A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms
Bi-level optimisation problems have gained increasing interest in the fi...
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
∙
05/27/2011
Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation
We reconsider stochastic convergence analyses of particle swarm optimisa...
research
∙
12/14/2010
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
The interplay between mutation and selection plays a fundamental role in...
research
∙
12/04/2010
