A bumble bees mating optimization algorithm for global unconstrained optimization problems

24Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new nature inspired algorithm, that simulates the mating behavior of the bumble bees, the Bumble Bees Mating Optimization (BBMO) algorithm, is presented in this paper for solving global unconstrained optimization problems. The performance of the algorithm is compared with other popular metaheuristic and nature inspired methods when applied to the most classic global unconstrained optimization problems. The methods used for comparisons are Genetic Algorithms, Island Genetic Algorithms, Differential Evolution, Particle Swarm Optimization, and the Honey Bees Mating Optimization algorithm. A high performance of the proposed algorithm is achieved based on the results obtained. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Marinakis, Y., Marinaki, M., & Matsatsinis, N. (2010). A bumble bees mating optimization algorithm for global unconstrained optimization problems. In Studies in Computational Intelligence (Vol. 284, pp. 305–318). https://doi.org/10.1007/978-3-642-12538-6_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free