Search Results for author:
Found 6 papers, 0 papers with code
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint
Linear functions have been traditionally studied in this area resulting in tight bounds on the expected optimisation time of simple randomised search algorithms for this class of problems.
Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem
Similar to the classical case, the dynamic changes that we consider on the weighted vertex cover problem are adding and removing edges to and from the graph.
Analysis of Baseline Evolutionary Algorithms for the Packing While Travelling Problem
In this paper, variations of the Packing While Travelling (PWT) -- also known as the non-linear knapsack problem -- are studied as an attempt to analyse the behaviour of EAs on non-linear problems from theoretical perspective.
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments
Many real-world optimization problems occur in environments that change dynamically or involve stochastic components.
Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem
A rigorous runtime analysis of evolutionary multi-objective optimization for the classical vertex cover problem in the context of parameterized complexity analysis has been presented by Kratsch and Neumann (2013).
A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms
For the generalised minimum spanning tree problem, we analyse the two approaches presented by Hu and Raidl (2012) with respect to the number of clusters that distinguish each other by the chosen representation of possible solutions.
