z-logo
open-access-imgOpen Access
Constrained artificial bee colony algorithm for optimization problems
Author(s) -
Soudeh Babaeizadeh,
Rohanin Ahmad
Publication year - 2016
Publication title -
aip conference proceedings
Language(s) - English
Resource type - Conference proceedings
eISSN - 1551-7616
pISSN - 0094-243X
DOI - 10.1063/1.4954521
Subject(s) - artificial bee colony algorithm , swarm intelligence , benchmark (surveying) , computer science , population , mathematical optimization , artificial intelligence , algorithm , mathematics , particle swarm optimization , demography , geodesy , sociology , geography
Artificial Bee Colony (ABC) algorithm is a relatively new swarm intelligence algorithm that has attracted great deal of attention from researchers in recent years with the advantage of less control parameters and strong global optimization ability. However, there is still an insufficiency in ABC regarding its solution search equation, which is good at exploration but poor at exploitation. This drawback can be even more significant when constraints are also involved. To address this issue, an Enhanced Constrained ABC algorithm (EC-ABC) is proposed for Constrained Optimization Problems (COPs) where two new solution search equations are introduced for employed bee and onlooker bee phases respectively. In addition, both chaotic search method and opposition-based learning mechanism are employed to be used in population initialization in order to enhance the global convergence when producing initial population. This algorithm is tested on several benchmark functions where the numerical results demonstrate that the EC-ABC is competitive with state of the art constrained ABC algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom