Sciweavers

Share
GECCO
2006
Springer

Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design

11 years 5 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Previous techniques calculate the mean effective objective (for robust) by using samples without much evenly distributing over the neighborhood. The samples by using orthogonal array distribute evenly. Therefore the calculation of mean effective objective more robust. The new technique is generalized from the ODEA algorithm [1]. An orthogonal design method is employed on the niches for the mutation operator to find a potentially good solution that may become the representative in the niche. The fitness of the offspring is therefore likely to be higher than that of its parent. We propose a complex benchmark, consisting of moving function peaks, to test our new approach. Numerical experiments show that the moving solutions of the algorithm are a little worse in objective value but robust. Categories and Subject Des...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug
Added 23 Aug 2010
Updated 23 Aug 2010
Type Conference
Year 2006
Where GECCO
Authors Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hugo de Garis, Lishan Kang, Lixin X. Ding
Comments (0)
books