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. © 2013 sung soo im et al.