By Topic

Accelerating the artificial bee colony algorithm by hardware parallel implementations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Muñoz, D.M. ; Dept. of Mech. Eng., Univ. of Brasilia, Brasilia, Brazil ; Llanos, C.H. ; Coelho, L.D.S. ; Ayala-Rincon, M.

Artificial bee colony (ABC) is an optimization algorithm inspired on the intelligent behavior of honey bee swarms. It is suitable to be applied when mathematical techniques are impractical or provide suboptimal solutions. As a population-based algorithm, the ABC suffers on large execution times specifically for embedded optimization problems with computational limitations. For that we propose a hardware parallel architecture of the opposition-based ABC algorithm (HPOABC) that facilitates the implementation in Field Programmable Gate Arrays (FPGAs). Numerical simulations using four well-known benchmark problems demonstrate that the opposition-based approach allows the algorithm to improve its functionality, preserving the swarm diversity. Additionally, synthesis results point outs that the HPOABC architecture is effectively mapped in hardware and is suitable for embedded applications.

Published in:

Circuits and Systems (LASCAS), 2012 IEEE Third Latin American Symposium on

Date of Conference:

Feb. 29 2012-March 2 2012