Efficient nonlinear optimization by differential evolution with a rotation-invariant local sampling operation

Differential Evolution (DE) is a newly proposed evolutionary algorithm. DE has been successfully applied to optimization problems including non-linear, non-differentiable, non-convex and multimodal functions. However, the performance of DE degrades in problems having strong dependence among variables, where variables are strongly related to each other. One of the desirable properties of optimization algorithms for solving the problems with the strong dependence is rotation-invariant property. In DE, the mutation operation is rotation-invariant, but the crossover operation is not rotation-invariant usually. In this study, we propose a new operation, called local sampling operation that is rotation-invariant. In the operation, independent points are selected from the population, difference vectors from a parent to the points span a local area centered at the parent, and a new point is generated around the area. Also, the operation is used for judging whether intensive search or extensive search is desirable in each generation. The effect of the proposed method is shown by solving some benchmark problems.

[1]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

[2]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[3]  Tetsuyuki Takahama,et al.  Solving Difficult Constrained Optimization Problems by the ε Constrained Differential Evolution with Gradient-Based Mutation , 2009 .

[4]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[5]  Arthur C. Sanderson,et al.  JADE: Adaptive Differential Evolution With Optional External Archive , 2009, IEEE Transactions on Evolutionary Computation.

[6]  Uday K. Chakraborty,et al.  Advances in Differential Evolution , 2010 .

[7]  Tetsuyuki Takahama,et al.  Solving nonlinear optimization problems by Differential Evolution with a rotation-invariant crossover operation using Gram-Schmidt process , 2010, 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC).

[8]  Tetsuyuki Takahama,et al.  Efficient Constrained Optimization by the ε Constrained Differential Evolution Using an Approximation Model with Low Accuracy , 2009 .

[9]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[10]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[11]  Jouni Lampinen,et al.  Constrained Real-Parameter Optimization with Generalized Differential Evolution , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[12]  Carlos A. Coello Coello,et al.  A comparative study of differential evolution variants for global optimization , 2006, GECCO.

[13]  M. Yamamura,et al.  Multi-parent recombination with simplex crossover in real coded genetic algorithms , 1999 .

[14]  Tetsuyuki Takahama,et al.  Reducing function evaluations in Differential Evolution using rough approximation-based comparison , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[15]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[16]  Yun Shang,et al.  A Note on the Extended Rosenbrock Function , 2006 .

[17]  Isao Ono,et al.  A Real Coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distributed Crossover , 1997, ICGA.

[18]  X. Yao,et al.  Fast evolutionary algorithms , 2003 .

[19]  Tetsuyuki Takahama,et al.  Constrained Optimization by the ε Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[20]  Shigenobu Kobayashi,et al.  The Frontiers of Real-coded Genetic Algorithms , 2009 .