A novel meta-heuristic optimization algorithm inspired by group hunting of animals: Hunting search

作     者：Oftadeh, R. Mahjoob, M. J. Shariatpanahi, M. 

作者机构：Univ Tehran Sch Mech Engn Ctr Mechatron & Automat Tehran Iran 

出 版 物：《COMPUTERS & MATHEMATICS WITH APPLICATIONS》 (Comput Math Appl)

年 卷 期：2010年第60卷第7期

页      面：2087-2098页

核心收录：

学科分类：08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Meta-heuristic algorithm Continuous optimization problems Group hunting 

摘      要：A novel optimization algorithm is presented, inspired by group hunting of animals such as lions, wolves, and dolphins. Although these hunters have differences in the way of hunting, they are common in that all of them look for a prey in a group. The hunters encircle the prey and gradually tighten the ring of siege until they catch the prey. In addition, each member of the group corrects its position based on its own position and the position of other members. If the prey escapes from the ring, hunters reorganize the group to siege the prey again. Several benchmark numerical optimization problems, constrained and unconstrained, are presented here to demonstrate the effectiveness and robustness of the proposed Hunting Search (HuS) algorithm. The results indicate that the proposed method is a powerful search and optimization technique. It yields better solutions compared to those obtained by some current algorithms when applied to continuous problems. (C) 2010 Elsevier Ltd. All rights reserved.