Solving nonlinear optimization problems by Differential Evolution with a rotation-invariant crossover operation using Gram-Schmidt process

Differential Evolution (DE) is a newly proposed evolutionary algorithm. DE is a stochastic direct search method using a population or multiple search points. DE has been successfully applied to optimization problems including nonlinear, non-differentiable, non-convex and multimodal functions. However, the performance of DE degrades in problems with strong linkage among variables, where variables are related strongly each other. One of the desirable properties of optimization algorithms for solving the problems with strong linkage is rotation-invariant property. The rotation-invariant algorithms can solve rotated problems where variables are strongly related as in the same way of solving non-rotated problems. In DE, two operations are applied to each individual: a mutation operation, which is rotation-invariant, and a crossover operation, which is not rotation-invariant. Thus, DE is not rotation-invariant. In this study, we propose a new crossover operation that is rotation-invariant. In order to achieve rotation-invariant property, instead of using the fixed coordinate system, a new coordinate system is build from a current population, or search points in search process. Independent points, or vectors are selected from the population, Gram-Schmidt process is applied to them in order to obtain orthogonal vectors, and the vectors form the new coordinate system. The effect of the rotation-invariant crossover operation is shown by solving some benchmark problems.

[1]  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).

[2]  Tetsuyuki Takahama,et al.  Solving Nonlinear Constrained Optimization Problems by the ε Constrained Differential Evolution , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

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

[4]  Tetsuyuki Takahama,et al.  Efficient constrained optimization by the ε constrained adaptive differential evolution , 2010, IEEE Congress on Evolutionary Computation.

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

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

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

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

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

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

[11]  Tetsuyuki Takahama,et al.  Constrained optimization by the ε constrained differential evolution with an archive and gradient-based mutation , 2010, IEEE Congress on Evolutionary Computation.

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

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

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

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

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

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

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