A bee foraging-based memetic Harmony Search method

The Harmony Search (HS) method is an emerging meta-heuristic optimization algorithm, which has been extensively applied to handle numerous optimization problems during the past decade. However, it usually lacks of an efficient local search capability, and may sometimes suffer from weak convergence. In this paper, a memetic HS method, m-HS, with local search function is proposed and studied. The local search in the m-HS is inspired by the principle of bee foraging, and performs only at selected harmony memory members, which can significantly improve the efficiency of the overall search procedure. Compared with the original HS method, our m-HS has been demonstrated in numerical simulations of 16 typical benchmark functions to yield a superior optimization performance.

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

[2]  Duc Truong Pham,et al.  The Bees Algorithm: Modelling foraging behaviour to solve continuous optimization problems , 2009 .

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

[4]  Riccardo Poli,et al.  Foundations of Genetic Programming , 1999, Springer Berlin Heidelberg.

[5]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[6]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[7]  Carlos Cotta,et al.  Memetic algorithms and memetic computing optimization: A literature review , 2012, Swarm Evol. Comput..

[8]  Antero Arkkio,et al.  A hybrid optimization method for wind generator design , 2012 .

[9]  Y. M. Cheng,et al.  An improved harmony search minimization algorithm using different slip surface generation methods for slope stability analysis , 2008 .

[10]  Zelda B. Zabinsky,et al.  A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems , 2005, J. Glob. Optim..

[11]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[12]  Xiaolei Wang,et al.  A hybrid optimization method of harmony search and opposition-based learning , 2012 .

[13]  Xiaolei Wang,et al.  UNI-MODAL AND MULTI-MODAL OPTIMIZATION USING MODIFIED HARMONY SEARCH METHODS , 2009 .

[14]  N. Nahas,et al.  Harmony search algorithm: application to the redundancy optimization problem , 2010 .

[15]  Zong Woo Geem,et al.  Harmony Search Optimization: Application to Pipe Network Design , 2002 .

[16]  K. Lee,et al.  A new structural optimization method based on the harmony search algorithm , 2004 .

[17]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[18]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .