Artificial Bee Colony Algorithm with Time-Varying Strategy. (7th April 2015)

• Record Type: Journal Article
• Authors: Qin, Quande; Cheng, Shi; Zhang, Qingyu; Li, Li; Shi, Yuhui
• Other Names: López-Ruiz Ricardo Academic Editor.
• Is Part Of: Discrete dynamics in nature and society. Volume 2015(2015)
• Publication Date: 2015-04-07
• Subjects: System analysis -- Periodicals; Dynamics -- Periodicals; Chaotic behavior in systems -- Periodicals; Differentiable dynamical systems -- Periodicals; 003.05
• DOI: 10.1155/2015/674595
• Languages: English
• ISSNs: 1026-0226

Abstract

Abstract : 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.