Honey Bee Mating Optimization with Nelder-Mead for Constrained Optimization, Integer Programming and Minimax Problems

Authors

Mohamed A. Tawhid, Department of Mathematics and Statistics, Faculty of Science, Thompson Rivers University, Kamloops, BC, Canada V2C 0C8\\ Department of Mathematics and Computer Science, Faculty of Science, Alexandria University, Moharam Bey 21511, Alexandria, EgyptFollow
Kurtis Manke, Department of Mathematics and Statistics, Faculty of Science, Thompson Rivers University, Kamloops, BC, Canada V2C 0C8Follow

Author Country (or Countries)

Egypt

Abstract

In this article, we propose a new hybrid Honey Bee Mating Optimization (HBMO) algorithm with simplex Nelder-Mead method in order to solve constrained optimization, integer programming and minimax problems. We call the proposed algorithm a hybrid Honey Bee Mating Optimization(HBMONM) algorithm. In the the proposed algorithm, we combine HBMO algorithm with Nelder-Mead method in order to refine the best obtained solution from the standard HBMO algorithm.We perform several experiments on a wide variety of well known test functions, 6 constrained optimization problems, 7 integer programming and 7 minimax benchmark problems.We compare the performance of HBMONMagainst standard HBMO algorithm and Genetic Algorithm (GA). In the majority of tests, HBMONM is shown to converge faster, and reach a better solution than both HBMO and GA in reasonable time.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/110104

Recommended Citation

A. Tawhid, Mohamed and Manke, Kurtis (2017) "Honey Bee Mating Optimization with Nelder-Mead for Constrained Optimization, Integer Programming and Minimax Problems," Applied Mathematics & Information Sciences: Vol. 11: Iss. 1, Article 4.
DOI: http://dx.doi.org/10.18576/amis/110104
Available at: https://digitalcommons.aaru.edu.jo/amis/vol11/iss1/4