By Topic

A modified fast marriage in honey bee optimization algorithm

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
$33 $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

2 Author(s)
M. T Vakil-Baghmisheh ; ICT Research Center, Faculty of Electrical & Computer Engineering, University of Tabriz, Iran ; Mina Salim

In this paper we present a modified version of an existing honey bee optimization algorithm: the modified fast marriage in honey bee optimization (MFMBO). Then we compare performances of this new algorithm and three existing 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 the modified algorithm is faster than the others in most cases. Especially for Griewank and Schwefel functions by increasing precision of answer and number of variables, the difference between the speeds of the FMBO and MFMBO becomes prominent. In general the MFMBO algorithm is quite competitive with the other mentioned algorithms.

Published in:

Telecommunications (IST), 2010 5th International Symposium on

Date of Conference:

4-6 Dec. 2010