Artificial Intelligence Review

, Volume 35, Issue 1, pp 73–84 | Cite as

Discrete bee algorithms and their application in multivariable function optimization

Article

Abstract

In this paper we present four discrete versions of two different existing honey bee optimization algorithms: the discrete artificial bee colony algorithm (DABC) and three versions of the discrete fast marriage in honey bee optimization algorithm (DFMBO1, DFMBO2, and DFMBO3). In these discretized algorithms we have utilized three logical operators, i.e. OR, AND and XOR operators. Then we have compared performances of our algorithms and those of three other bee algorithms, i.e. the artificial bee colony (ABC), the queen bee (QB), and the fast marriage in honey bee optimization (FMBO) on four benchmark functions for various numbers of variables up to 100. The obtained results show that our discrete algorithms are faster than other algorithms. In general, when precision of answer and number of variables are low, the difference between our new algorithms and the other three algorithms is small in terms of speed, but by increasing precision of answer and number of variables, the needed number of function evaluations for other algorithms increases beyond manageable amounts, hence their success rates decrease. Among our proposed discrete algorithms, the DFMBO3 is always fast, and achieves a success rate of 100% on all benchmarks with an average number of function evaluations not more than 1010.

Keywords

Artificial bee colony algorithm Discrete artificial bee colony algorithm Fast marriage in honey bee optimization Discrete fast marriage in honey bee optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afshinmanesh F, Marandi A, Rahimi-Kian A (2005) A novel binary particle swarm optimization method using artificial immune system. The international conference on computer as a tool (EUROCON 2005), vol 1., pp 217–220Google Scholar
  2. Arora JS, Huang MW (1994) Methods for optimization of nonlinear problems with discrete variables: a review. Struct Multidiscip Optim 8(2–3): 69–85Google Scholar
  3. Basturk B, Karaboga D (2006) An artificial bee colony (ABC) algorithm for numeric function optimization. In: Proceedings of the IEEE swarm intelligence symposium 2006. Indianapolis, Indiana, USAGoogle Scholar
  4. Bonabeau E, Dorigo M, Theraulaz G (1999) From natural to artificial swarm intelligence. Oxford University Press, OxfordMATHGoogle Scholar
  5. Dorigo M, Stützle T (2005) Ant colony optimization. Prentice-Hall, Englewood CliffsGoogle Scholar
  6. Eberhart R, Kennedy J (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of the IEEE conference on computational cybernetics and simulation (Systems, Man, and Cybernetics), vol 5., pp 4104–4109Google Scholar
  7. Holland J (1975) Adoption in natural and artificial systems. University of Michigan Press, MichiganGoogle Scholar
  8. Hsu YL, Dong YH, Hsu MS (2001) A sequential approximation method using neural networks for nonlinear discrete-variable optimization with implicit constraints. JSME Int J Ser C Mech Syst Mach Elem Manuf 44(1): 103–112Google Scholar
  9. Huang MW, Arora JS (1997) Optimal design with discrete variables: some numerical experiments. Int J Numer Methods Eng 40(1): 165–188CrossRefGoogle Scholar
  10. Jung SH (2003) Queen-bee evolution for genetic algorithms. Electron Lett 39(6): 575–576CrossRefGoogle Scholar
  11. Karaboga V, Akay B, Ozturk C (2007) Artificial bee colony (ABC) optimization algorithm for training feedforward neural networks. In: Proceedings of the 4th international conference on modeling decisions for artificial intelligence., pp 318–329Google Scholar
  12. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony. Glob Optim 39(3): 459–471MATHCrossRefMathSciNetGoogle Scholar
  13. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings. of IEEE international conference on neural networks (ICNN), Australia, vol 4., pp 1942–1948Google Scholar
  14. Kirkpatrick S, Gelatt CD, Vecchi MP (1993) Optimization by simulated annealing. Science 220: 671–680CrossRefMathSciNetGoogle Scholar
  15. Liu B, Wang L, Jin Yh, Huang D (2006) An effective PSO-based memetic algorithm for TSP. In: Intelligent computing in signal processing and pattern recognition, vol 345. Springer, Berlin, pp 1151–1156Google Scholar
  16. Mohan CK, Al-kazemi B (2001) Discrete particle swarm optimization, In: Proceedings of the workshop on particle swarm optimization, IndianapolisGoogle Scholar
  17. Qin LD, Jiang QY, Zou ZY, Cao YJ (2004) A queen-bee evolution based on genetic algorithm for economic power dispatch. In: 39th international universities power engineering conference (UPEC 2004) Bristol, UK, pp 453–456Google Scholar
  18. Sandini G, Santos-Victor J, Curtto F, Garibaldi S (1993) Robotic bees. In: IEEE/RSJ international conference on intelligent robots and system, vol 1. Yokohama, Japan, pp 629–635Google Scholar
  19. Sato T, Hagiwara M (1997) Bee system: finding solution by a concentrated search. In: Proceedings of the IEEE international conference on systems, man, and cybernetics, vol 4(C)., pp 3954–3959Google Scholar
  20. Yang C, Chen J, Xuyan T (2007) Algorithm of fast marriage in honey bees optimization and convergence analysis. In: Proceedings of the IEEE international conference on automation and logistics, China., pp 1794–1799Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  1. 1.ICT Research Center, Faculty of Electrical & Computer EngineeringUniversity of TabrizTabrizIran

Personalised recommendations