Modification of ABC Algorithm for Adaptation to Time-Varying Functions

2012 ◽  
Vol 132 (4) ◽  
pp. 584-591 ◽  
Author(s):  
Takeshi Nishida
Keyword(s):  
2015 ◽  
Vol 2015 ◽  
pp. 1-17 ◽  
Author(s):  
Quande Qin ◽  
Shi Cheng ◽  
Qingyu Zhang ◽  
Li Li ◽  
Yuhui Shi

Artificial bee colony (ABC) is one of the newest additions to the class of swarm intelligence. ABC algorithm has been shown to be competitive with some other population-based algorithms. However, there is still an insufficiency that ABC is good at exploration but poor at exploitation. To make a proper balance between these two conflictive factors, this paper proposed a novel ABC variant with a time-varying strategy where the ratio between the number of employed bees and the number of onlooker bees varies with time. The linear and nonlinear time-varying strategies can be incorporated into the basic ABC algorithm, yielding ABC-LTVS and ABC-NTVS algorithms, respectively. The effects of the added parameters in the two new ABC algorithms are also studied through solving some representative benchmark functions. The proposed ABC algorithm is a simple and easy modification to the structure of the basic ABC algorithm. Moreover, the proposed approach is general and can be incorporated in other ABC variants. A set of 21 benchmark functions in 30 and 50 dimensions are utilized in the experimental studies. The experimental results show the effectiveness of the proposed time-varying strategy.


2016 ◽  
Author(s):  
Felix Schindler ◽  
Bertram Steininger ◽  
Tim Kroencke

Sign in / Sign up

Export Citation Format

Share Document