DocumentCode
2277914
Title
Binary artificial bee colony optimization
Author
Pampará, G. ; Engelbrecht, AP
Author_Institution
Dept. of Comput. Sci., Univ. of Pretoria, Pretoria, South Africa
fYear
2011
fDate
11-15 April 2011
Firstpage
1
Lastpage
8
Abstract
Artificial bee colony (ABC) optimization is a relatively new population-based, stochastic optimization technique. ABC was developed to optimize unconstrained problems within continuous-valued domains. This paper proposes three versions of ABC that enable it to be applied to optimization problems with binary-valued domains. The performances of these binary ABC algorithms are compared on a benchmark of unconstrained optimization problems. The best of these algorithms, i.e. angle-modulated ABC (AMABC), is then compared with the angle-modulated particle swarm optimizer and the angle-modulated differential evolution algorithm.
Keywords
evolutionary computation; particle swarm optimisation; angle-modulated ABC; angle-modulated differential evolution algorithm; angle-modulated particle swarm optimizer; binary ABC algorithms; binary artificial bee colony optimization; binary-valued domains; continuous-valued domains; population-based stochastic optimization technique; unconstrained optimization problems; Equations; Mathematical model; Minimization; Modulation; Optimization; Particle swarm optimization; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Swarm Intelligence (SIS), 2011 IEEE Symposium on
Conference_Location
Paris
Print_ISBN
978-1-61284-053-6
Type
conf
DOI
10.1109/SIS.2011.5952562
Filename
5952562
Link To Document