On a vector space representation in genetic algorithms for sensor scheduling in wireless sensor networks
Recent works raised the hypothesis that the assignment of a geometry to the decision variable space of a combinatorial problem could be useful both for providing meaningful descriptions of the fitness landscape and for supporting the systematic ...
General upper bounds on the runtime of parallel evolutionary algorithms*
We present a general method for analyzing the runtime of parallel evolutionary algorithms with spatially structured populations. Based on the fitness-level method, it yields upper bounds on the expected parallel runtime. This allows for a rigorous ...
Test problem construction for single-objective bilevel optimization
In this paper, we propose a procedure for designing controlled test problems for single-objective bilevel optimization. The construction procedure is flexible and allows its user to control the different complexities that are to be included in the test ...
Life on the edge: Characterising the edges of mutually non-dominating sets
Multi-objective optimisation yields an estimated Pareto front of mutually non-dominating solutions, but with more than three objectives, understanding the relationships between solutions is challenging. Natural solutions to use as landmarks are those ...
On the behaviour of the (1, λ)-es for conically constrained linear problems
We study the behaviour of a <inline-formula><inline-graphic xlink="EVCO_a_00125inline1.gif" xlink:type="simple"/></inline-formula>-ES that handles constraints by resampling infeasible candidate solutions for linear optimization problems with a conically ...