12 papers
Provable Speedups From Dynamic Population Sizes in Evolutionary Algorithms for Multiobjective Optimization
Andre Opris
This paper investigates the role of dynamic population sizes in evolutionary multi-objective optimization. Although such approaches are widely used in practice, their benefits rema…
Runtime Analysis of Cartesian Genetic Programming in Evolving Boolean Functions
Duc-Cuong Dang, Roman Kalkreuth, Andre Opris
Cartesian Genetic Programming (CGP) is among the practical and popular forms of Genetic Programming as it uses a graph-based representation of programs. This paper presents a first…
SPEA2: Improved Density Estimation in SPEA2 with Provable Runtime Guarantees
Duc-Cuong Dang, Andre Opris, Dirk Sudholt
The Strength Pareto Evolutionary Algorithm 2 (SPEA2) is a popular and prominent evolutionary algorithm for solving multi-objective optimisation problems. Despite its popularity, th…
On the Impact of Crossover in Many-Objective Optimization: A Runtime Analysis of NSGA-III
Andre Opris
In recent years, a theoretical understanding has rapidly advanced regarding how popular multi-objective evolutionary algorithms (MOEAs) can optimize many-objective problems. Howeve…
Parent Selection Mechanisms in Elitist Crossover-Based Algorithms
Andre Opris, Denis Antipov
Parent selection methods are widely used in evolutionary computation to accelerate the optimization process, yet their theoretical benefits are still poorly understood. In this pap…
Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
Andre Opris
NSGA-III is a prominent algorithm in evolutionary many-objective optimization. It is particularly well suited for optimizing problems with more than three objectives, distinguishin…