We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
In this work, we employed genetic programming to evolve a "white hat" attacker; that is to say, we evolve variants of an attack with the objective of providing better de...
In this paper we compare Mixed-Integer Evolution Strategies (MI-ES) and standard Evolution Strategies (ES) when applied to find optimal solutions for artificial test problems and ...
Rui Li, Michael Emmerich, Jeroen Eggermont, Ernst ...
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...