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

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.

[1]  Marco Dorigo,et al.  Ant colony optimization for continuous domains , 2008, Eur. J. Oper. Res..

[2]  Nicolas Monmarché,et al.  On how Pachycondyla apicalis ants suggest a new search algorithm , 2000, Future Gener. Comput. Syst..

[3]  Donald E. Grierson,et al.  Comparison among five evolutionary-based optimization algorithms , 2005, Adv. Eng. Informatics.

[4]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[5]  Zong Woo Geem,et al.  Novel derivative of harmony search algorithm for discrete design variables , 2008, Appl. Math. Comput..

[6]  Mahamed G. H. Omran,et al.  Global-best harmony search , 2008, Appl. Math. Comput..

[7]  J. Dréo,et al.  Continuous interacting ant colony algorithm based on dense heterarchy , 2004, Future Gener. Comput. Syst..

[8]  Ian C. Parmee,et al.  The Ant Colony Metaphor for Searching Continuous Design Spaces , 1995, Evolutionary Computing, AISB Workshop.

[9]  David B. Fogel,et al.  A Comparison of Evolutionary Programming and Genetic Algorithms on Selected Constrained Optimization Problems , 1995, Simul..

[10]  John R. Koza,et al.  Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems , 1990 .

[11]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[12]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[13]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[14]  M. Fesanghary,et al.  An improved harmony search algorithm for solving optimization problems , 2007, Appl. Math. Comput..

[15]  M. Mahdavi,et al.  ARTICLE IN PRESS Available online at www.sciencedirect.com , 2007 .

[16]  Zbigniew Michalewicz,et al.  Genetic AlgorithmsNumerical Optimizationand Constraints , 1995, ICGA.

[17]  K. Deb An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[18]  K. Lee,et al.  A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .

[19]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[20]  F. Glover HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[21]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[22]  G. McCormick,et al.  Selected applications of nonlinear programming , 1968 .

[23]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[24]  Mohammed Atiquzzaman,et al.  Optimal design of water distribution network using shu2ed complex evolution , 2004 .

[25]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..