Differential evolution variants for Searching D- and A-optimal designs

by   Lyuyang Tong, et al.

Optimal experimental design is an essential subfield of statistics that maximizes the chances of experimental success. The D- and A-optimal design is a very challenging problem in the field of optimal design, namely minimizing the determinant and trace of the inverse Fisher information matrix. Due to the flexibility and ease of implementation, traditional evolutionary algorithms (EAs) are applied to deal with a small part of experimental optimization design problems without mathematical derivation and assumption. However, the current EAs remain the issues of determining the support point number, handling the infeasible weight solution, and the insufficient experiment. To address the above issues, this paper investigates differential evolution (DE) variants for finding D- and A-optimal designs on several different statistical models. The repair operation is proposed to automatically determine the support point by combining similar support points with their corresponding weights based on Euclidean distance and deleting the support point with less weight. Furthermore, the repair operation fixes the infeasible weight solution into the feasible weight solution. To enrich our optimal design experiments, we utilize the proposed DE variants to test the D- and A-optimal design problems on 12 statistical models. Compared with other competitor algorithms, simulation experiments show that LSHADE can achieve better performance on the D- and A-optimal design problems.


page 1

page 2

page 3

page 4


Removal of the points that do not support an E-optimal experimental design

We propose a method of removal of design points that cannot support any ...

Influence of the Binomial Crossover on Performance of Evolutionary Algorithms

In differential Evolution (DE) algorithms, a crossover operation filteri...

Focused Jump-and-Repair Constraint Handling for Fixed-Parameter Tractable Graph Problems

Repair operators are often used for constraint handling in constrained c...

An Efficient Piggybacking Design Framework with Sub-packetization l≤ r for All-Node Repair

Piggybacking design has been widely applied in distributed storage syste...

Solution Repair/Recovery in Uncertain Optimization Environment

Operation management problems (such as Production Planning and Schedulin...

Differential evolution outside the box

This paper investigates how often the popular configurations of Differen...

Quantifying the Impact of Boundary Constraint Handling Methods on Differential Evolution

Constraint handling is one of the most influential aspects of applying m...

Please sign up or login with your details

Forgot password? Click here to reset