A robust and efficient algorithm for numerical optimization problem: DEPSO-Scout: A new hybrid algorithm based on DEPSO and ABC

This paper presents a new hybrid algorithm that well performs in solving the numerical optimization problem. The DEPSO-Scout is inspired by Differential Evolution (DE), Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC). Strong points of DE and PSO which is solution exploitation and exploration are used in algorithm design. We propose a new idea about how to combine DE and PSO to reduce the chance of getting stuck into local optima. Adaptive weight in PSO is introduced to balance exploration and exploitation phase. Moreover, with the interesting characteristic of Artificial Bee Colony (ABC) in suboptimal avoidance, scout Bee concept is then selected and included to be a part of proposed algorithm. The experimental result on three numerical benchmark functions shows that the proposed DEPSO-Scout outperform DE, PSO, and ABC. The improvement opportunity of DEPSO-Scout is discussed in the last section.

[1]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[2]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[3]  Reza Firsandaya Malik,et al.  New particle swarm optimizer with sigmoid increasing inertia weight , 2007 .

[4]  M. Batouche,et al.  Hybrid particle swarm with differential evolution for multimodal image registration , 2004, 2004 IEEE International Conference on Industrial Technology, 2004. IEEE ICIT '04..

[5]  H. H. Rosenbrock,et al.  An Automatic Method for Finding the Greatest or Least Value of a Function , 1960, Comput. J..

[6]  Xiao-Feng Xie,et al.  DEPSO: hybrid particle swarm with differential evolution operator , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

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

[8]  D. Altman,et al.  Multiple significance tests: the Bonferroni method , 1995, BMJ.

[9]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[10]  Heinz Mühlenbein,et al.  The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..

[11]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[12]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

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