Increasing Robustness of Differential Evolution by Passive Opposition

The differential evolution (DE) algorithm is known to be fairly robust among various global optimization algorithms. However, the application of this algorithm to an extensive set of test functions shows DE fails at least partially on 19 % of the test functions, and completely on 6.9 % of the test functions. The opposition-based DE in the literature, while aimed to improve the efficiency of DE, has a robustness even worse than that of the classic DE. In this paper we describe a new variant of DE called “passive oppositional differential evolution” (PODE) which utilizes opposition in such a way that a set of opposite vectors, while not part of the population, are used in mutation to gain diversity. Numerical experiments show that compared to DE and ODE, it has a much better robustness and a similar speed of convergence.

[1]  Shahryar Rahnamayan,et al.  A note on "Opposition versus randomness in soft computing techniques" [Appl. Soft Comput 8 (2) (2008) 906-918] , 2010, Appl. Soft Comput..

[2]  René Thomsen,et al.  A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[3]  Hamid R. Tizhoosh,et al.  Opposition-Based Learning: A New Scheme for Machine Intelligence , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).

[4]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[5]  Zelda B. Zabinsky,et al.  A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems , 2005, J. Glob. Optim..

[6]  M.M.A. Salama,et al.  Opposition-Based Differential Evolution , 2008, IEEE Transactions on Evolutionary Computation.

[7]  Harish Sharma,et al.  Lèvy Flight Based Local Search in Differential Evolution , 2013, SEMCCO.

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

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

[10]  Shahryar Rahnamayan,et al.  Opposition versus randomness in soft computing techniques , 2008, Appl. Soft Comput..

[11]  Shahryar Rahnamayan,et al.  Quasi-oppositional Differential Evolution , 2007, 2007 IEEE Congress on Evolutionary Computation.