A novel meta-heuristic algorithm for numerical function optimization: Blind, naked mole-rats (BNMR) algorithm

摘要

Optimization algorithms inspired by the world of nature have turned into powerful tools for solving the complicated problems. However, they have still some drawbacks need the investigation of new and better optimization algorithms. In this paper, we propose a new meta-heuristic algorithm called blind naked mole-rats (BNMR) algorithm. This algorithm has been developed based on the social behavior of the blind naked mole-rats colony in searching the food and protecting the colony against invasions. By introducing this algorithm, we have tried to overcome many disadvantages of the usual optimization algorithms including getting trapped in local minimums or having low rate of convergence. Using several benchmark functions, we demonstrate the superior performance of the proposed algorithm in comparison with some other well-known optimization algorithms.