Binary artificial bee colony optimization

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.

[1]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[2]  Fernando Buarque de Lima Neto,et al.  A novel search algorithm based on fish school behavior , 2008, 2008 IEEE International Conference on Systems, Man and Cybernetics.

[3]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[4]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[5]  N. Franken,et al.  Combining particle swarm optimisation with angle modulation to solve binary problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[6]  John Hallam,et al.  IEEE International Joint Conference on Neural Networks , 2005 .

[7]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[8]  Andries Petrus Engelbrecht,et al.  Binary Differential Evolution , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[9]  Kevin M. Passino,et al.  Distributed optimization and control using only a germ of intelligence , 2000, Proceedings of the 2000 IEEE International Symposium on Intelligent Control. Held jointly with the 8th IEEE Mediterranean Conference on Control and Automation (Cat. No.00CH37147).

[10]  Slawomir Zak,et al.  Firefly Algorithm for Continuous Constrained Optimization Tasks , 2009, ICCCI.

[11]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[12]  R. Storn,et al.  On the usage of differential evolution for function optimization , 1996, Proceedings of North American Fuzzy Information Processing.

[13]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[14]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.