Smallest-Small-World Cellular Harmony Search for Optimization of Unconstrained Benchmark Problems

We presented a new hybrid method that combines cellular harmony search algorithms with the Smallest-Small-World theory. A harmony search (HS) algorithm is based on musical performance processes that occur when a musician searches for a better state of harmony. Harmony search has successfully been applied to a wide variety of practical optimization problems. Most of the previous researches have sought to improve the performance of the HS algorithm by changing the pitch adjusting rate and harmony memory considering rate. However, there has been a lack of studies to improve the performance of the algorithm by the formation of population structures. Therefore, we proposed an improved HS algorithm that uses the cellular automata formation and the topological structure of Smallest-Small-World network. The improved HS algorithm has a high clustering coefficient and a short characteristic path length, having good exploration and exploitation efficiencies. Nine benchmark functions were applied to evaluate the performance of the proposed algorithm. Unlike the existing improved HS algorithm, the proposed algorithm is expected to have improved algorithmic efficiency from the formation of the population structure.

[1]  Mohammad Reza Meybodi,et al.  CellularDE: A Cellular Based Differential Evolution for Dynamic Optimization Problems , 2011, ICANNGA.

[2]  Adilson E Motter,et al.  Smallest small-world network. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

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

[5]  M. R. Meybodi,et al.  A multi-role cellular PSO for dynamic environments , 2009, 2009 14th International CSI Computer Conference.

[6]  Giandomenico Spezzano,et al.  Combining cellular genetic algorithms and local search for solving satisfiability problems , 1998, Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294).

[7]  Dávid Bálya,et al.  Regular small-world cellular neural networks: key properties and experiments , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[8]  Z. Geem,et al.  PARAMETER ESTIMATION OF THE NONLINEAR MUSKINGUM MODEL USING HARMONY SEARCH 1 , 2001 .

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

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

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

[12]  Tae-Won Kang.  Smallest-Small-World Cellular Genetic Algorithms , 2007 .

[13]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[14]  Martin Suter,et al.  Small World , 2002 .

[15]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[16]  Enrique Alba,et al.  A Simple Cellular Genetic Algorithm for Continuous Optimization , 2006, 2006 IEEE International Conference on Evolutionary Computation.