Velocity based artificial bee colony algorithm for high dimensional continuous optimization problems

被引:59
作者
Imanian, Nafiseh [1 ]
Shiri, Mohammad Ebrahim [1 ]
Moradi, Parham [2 ]
机构
[1] Amirkabir Univ Technol, Dept Math & Comp Sci, Tehran, Iran
[2] Univ Kurdistan, Dept Comp Engn, Sanandaj, Iran
关键词
Particle swarm optimization; Artificial bee colony; Continuous optimization; Hybrid optimization algorithm; PARTICLE SWARM OPTIMIZATION; GENETIC ALGORITHM; DIFFERENTIAL EVOLUTION; GLOBAL OPTIMIZATION; HYBRID; EFFICIENT; ABC;
D O I
10.1016/j.engappai.2014.07.012
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Artificial bee colony (ABC) is a swarm optimization algorithm which has been shown to be more effective than the other population based algorithms such as genetic algorithm (GA), particle swarm optimization (PSO) and ant colony optimization (ACO). Since it was invented, it has received significant interest from researchers studying in different fields because of having fewer control parameters, high global search ability and ease of implementation. Although ABC is good at exploration, the main drawback is its poor exploitation which results in an issue on convergence speed in some cases. Inspired by particle swarm optimization, we propose a modified ABC algorithm called VABC, to overcome this insufficiency by applying a new search equation in the onlooker phase, which uses the PSO search strategy to guide the search for candidate solutions. The experimental results tested on numerical benchmark functions show that the VABC has good performance compared with PSO and ABC. Moreover, the performance of the proposed algorithm is also compared with those of state-of-the-art hybrid methods and the results demonstrate that the proposed method has a higher convergence speed and better search ability for almost all functions. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:148 / 163
页数:16
相关论文
共 60 条
[1]   A multi-objective artificial bee colony algorithm [J].
Akbari, Reza ;
Hedayatzadeh, Ramin ;
Ziarati, Koorush ;
Hassanizadeh, Bahareh .
SWARM AND EVOLUTIONARY COMPUTATION, 2012, 2 :39-52
[2]   The best-so-far ABC with multiple patrilines for clustering problems [J].
Banharnsakun, Anan ;
Sirinaovakul, Booncharoen ;
Achalakul, Tiranee .
NEUROCOMPUTING, 2013, 116 :355-366
[3]   The best-so-far selection in Artificial Bee Colony algorithm [J].
Banharnsakun, Anan ;
Achalakul, Tiranee ;
Sirinaovakul, Booncharoen .
APPLIED SOFT COMPUTING, 2011, 11 (02) :2888-2901
[4]   Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration [J].
Bank, M. ;
Ghomi, S. M. T. Fatemi ;
Jolai, F. ;
Behnamian, J. .
ADVANCES IN ENGINEERING SOFTWARE, 2012, 47 (01) :1-6
[5]  
Bonabeau M. E., 1999, SWARM INTELLIGENCE N
[6]  
Bremermann H.A., 1970, MATH BIOSCI, V9, P1
[7]   Artificial Bee Colony Training of Neural Networks [J].
Bullinaria, John A. ;
AlYahya, Khulood .
NATURE INSPIRED COOPERATIVE STRATEGIES FOR OPTIMIZATION (NICSO 2013), 2014, 512 :191-201
[8]   Efficient ant colony optimization for image feature selection [J].
Chen, Bolun ;
Chen, Ling ;
Chen, Yixin .
SIGNAL PROCESSING, 2013, 93 (06) :1566-1576
[9]   Simulated annealing based artificial bee colony algorithm for global numerical optimization [J].
Chen, Shi-Ming ;
Sarosh, Ali ;
Dong, Yun-Feng .
APPLIED MATHEMATICS AND COMPUTATION, 2012, 219 (08) :3575-3589
[10]   On the improvements of the particle swarm optimization algorithm [J].
Chen, Ting-Yu ;
Chi, Tzu-Ming .
ADVANCES IN ENGINEERING SOFTWARE, 2010, 41 (02) :229-239