A recombination-based hybridization of particle swarm optimization and artificial bee colony algorithm for continuous optimization problems

作者：Kiran Mustafa Servet^*; Gunduz Mesut

来源：Applied Soft Computing, 2013, 13(4): 2188-2203.

DOI：10.1016/j.asoc.2012.12.007

• Artificial bee colony
• Particle swarm optimization
• Recombination procedure
• Hybridization
• Continuous optimization

This paper presents a hybridization of particle swarm optimization (PSO) and artificial bee colony (ABC) approaches, based on recombination procedure. The PSO and ABC are population-based iterative methods. While the PSO directly uses the global best solution of the population to determine new positions for the particles at the each iteration, agents (employed, onlooker and scout bees) of the ABC do not directly use this information but the global best solution in the ABC is stored at the each iteration. The global best solutions obtained by the PSO and ABC are used for recombination, and the solution obtained from this recombination is given to the populations of the PSO and ABC as the global best and neighbor food source for onlooker bees, respectively. Information flow between particle swarm and bee colony helps increase global and local search abilities of the hybrid approach which is referred to as Hybrid approach based on Particle swarm optimization and Artificial bee colony algorithm, HPA for short. In order to test the performance of the HPA algorithm, this study utilizes twelve basic numerical benchmark functions in addition to CEC2005 composite functions and an energy demand estimation problem. The experimental results obtained by the HPA are compared with those of the PSO and ABC. The performance of the HPA is also compared with that of other hybrid methods based on the PSO and ABC. The experimental results show that the HPA algorithm is an alternative and competitive optimizer for continuous optimization problems.

• 出版日期2013-4