Michael Hellwig

Dr. Michael Hellwig


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2019 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
MHMichael Hellwig
Michael Hellwig
HBHans-Georg Beyer
Hans-Georg Beyer

1 July 2018
Verified
Conference Paper
Closed access
MHMichael Hellwig
Michael Hellwig
HBHans-Georg Beyer
Hans-Georg Beyer
By combination of successful constraint handling techniques known within the context of Differential Evolution with the recently suggested Matrix Adaptation Evolution Strategy (MA-ES), a new Evolution Strategy for constrained optimization is presented. The novel MA - ES variant is applied to the benchmark problems specified for the CEC 2018 competition on constrained single objective real-parameter optimization. The algorithm is able to find feasible solutions on more than 80 % of the benchmark problems with high accuracy.

24 September 2018 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
PSPatrick Spettel
Patrick Spettel
HBHans-Georg Beyer
Hans-Georg Beyer
MHMichael Hellwig
Michael Hellwig
This paper addresses the development of a covariance matrix self-adaptation evolution strategy (CMSA-ES) for solving optimization problems with linear constraints. The proposed algorithm is referred to as Linear Constraint CMSA-ES (lcCMSA-ES). It uses a specially built mutation operator together with repair by projection to satisfy the constraints. The lcCMSA-ES evolves itself on a linear manifold defined by the constraints. The objective function is only evaluated at feasible search points (interior point method). This is a property often required in application domains such as simulation optimization and finite element methods. The algorithm is tested on a variety of different test problems revealing considerable results.

1 March 2016 in Evolutionary Computation
Verified
Journal Article
Closed access
HBHans-Georg Beyer
Hans-Georg Beyer
MHMichael Hellwig
Michael Hellwig
The behavior of the [ ]-Evolution Strategy (ES) with cumulative step size adaptation (CSA) on the ellipsoid model is investigated using dynamic systems analysis. At first a nonlinear system of difference equations is derived that describes the mean value evolution of the ES. This system is successively simplified to finally allow for deriving closed-form solutions of the steady state behavior in the asymptotic limit case of large search space dimensions. It is shown that the system exhibits linear convergence order. The steady state mutation strength is calculated, and it is shown that compared to standard settings in [ ] self-adaptive ESs, the CSA control rule allows for an approximately [ ]-fold larger mutation strength. This explains the superior performance of the CSA in non-noisy environments. The results are used to derive a formula for the expected running time. Conclusions regarding the choice of the cumulation parameter c and the damping constant D are drawn.


1 March 2016 in Evolutionary Computation
Verified
Journal Article
Closed access
MHMichael Hellwig
Michael Hellwig
DADirk V. Arnold
Dirk V. Arnold
This paper investigates constraint-handling techniques used in nonelitist single-parent evolution strategies for the problem of maximizing a linear function with a single linear constraint. Two repair mechanisms are considered, and the analytical results are compared to those of earlier repair approaches in the same fitness environment. The first algorithm variant applies reflection to initially infeasible candidate solutions, and the second repair method uses truncation to generate feasible solutions from infeasible ones. The distributions describing the strategies’ one-generation behavior are calculated and used in a zeroth-order model for the steady state attained when operating with fixed step size. Considering cumulative step size adaptation, the qualitative differences in the behavior of the algorithm variants can be explained. The approach extends the theoretical knowledge of constraint-handling methods in the field of evolutionary computation and has implications for the design of constraint-handling techniques in connection with cumulative step size adaptation.