A modified fast marriage in honey bee optimization algorithm

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.