61 citations · 570 across the 108 of their papers we have counts for
83 papers · 1 filter
Fixed-Parameter Tractability of the (1+1) Evolutionary Algorithm on Random Planted Vertex Covers
Jack Kearney, Frank Neumann, Andrew M. Sutton
We present the first parameterized analysis of a standard (1+1) Evolutionary Algorithm on a distribution of vertex cover problems. We show that if the planted cover is at most loga…
Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax
Denis Antipov, Aneta Neumann, Frank Neumann
The evolutionary diversity optimization aims at finding a diverse set of solutions which satisfy some constraint on their fitness. In the context of multi-objective optimization th…
On the Impact of Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem
Jakob Bossek, Aneta Neumann, Frank Neumann
Evolutionary algorithms have been shown to obtain good solutions for complex optimization problems in static and dynamic environments. It is important to understand the behaviour o…
Analysis of the (1+1) EA on LeadingOnes with Constraints
Tobias Friedrich, Timo Kötzing, Aneta Neumann +2
Understanding how evolutionary algorithms perform on constrained problems has gained increasing attention in recent years. In this paper, we study how evolutionary algorithms optim…
Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting
Michael Stimson, William Reid, Aneta Neumann +2
Mine planning is a complex task that involves many uncertainties. During early stage feasibility, available mineral resources can only be estimated based on limited sampling of ore…
Evolutionary Diversity Optimisation in Constructing Satisfying Assignments
Adel Nikfarjam, Ralf Rothenberger, Frank Neumann +1
Computing diverse solutions for a given problem, in particular evolutionary diversity optimisation (EDO), is a hot research topic in the evolutionary computation community. This pa…