Orthogonal evolutionary algorithm for dynamic robust optimization problems
Guang Chen · Jisuanji yingyong yanjiu · 2008
This paper proposed a robust dynamic evolutionary algorithm based on orthogonal design(RODEA).The population of the dynamic evolutionary algorithm consisted of niches.Each niche had a representative which represented its fitness.An orthogonal design method was 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 was therefore likely to be higher than that of its parent.It employ a complex benchmark,consisting of moving function peaks,to test new approach.Numerical experiments show that the moving solutions of the algorithm are a little worse in objective value but robust.