An improved artificial bee colony algorithm for balancing local and global search behaviors in continuous optimization

2020 ◽  
Vol 11 (9) ◽  
pp. 2051-2076 ◽  
Author(s):  
Huseyin Hakli ◽  
Mustafa Servet Kiran
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Continuous Optimization ◽  
Global Search ◽  
Bee Colony ◽  
Search Behaviors

An Improved Method of Artificial Bee Colony Algorithm

2011 ◽  
Vol 101-102 ◽  
pp. 315-319 ◽  
Author(s):  
Xin Jie Wu ◽  
Duo Hao ◽  
Chao Xu
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Simulation Experiment ◽  
Optimization Problems ◽  
Local Extremum ◽  
Global Search ◽  
Improved Method ◽  
Object Function ◽  
Bee Colony ◽  
Better Than

The basic artificial bee colony algorithm gets local extremum easily and converges slowly in optimization problems of the multi-object function. In order to enhance the global search ability of basic artificial bee colony algorithm, an improved method of artificial bee colony algorithm is proposed in this paper. The basic idea of this method is as follows: On the basis of traditional artificial bee colony algorithm, the solution vectors that found by each bee colony are recombined after each iteration, then the solution vectors of combinations are evaluated again, thus the best result is found in this iteration. In this way the possibility of sticking at local extremum is reduced. Finally the simulation experiment has been finished. The simulation experiment results have shown that the method proposed in this paper is feasible and effective, it is better than basic artificial bee colony algorithm in the global search ability.

Sign in / Sign up

Export Citation Format

Share Document