Opposition-Based Improved Harmony Search Algorithm Solve Unconstrained Optimization Problems

This paper develops an opposition-based improved harmony search algorithm (OIHS) for solving global continuous optimization problems. The proposed method is different from the classical harmony search (HS) in three aspects. Firstly, the candidate harmony is randomly chosen from the harmony memory or opposition harmony memory was generated by opposition-based learning, which enlarged the algorithm search space. Secondly, two key control parameters, pitch adjustment rate (PAR) and bandwidth distance (bw), are adjusted dynamically with respect to the evolution of the search process. Numerical results demonstrate that the proposed algorithm performs much better than the existing HS variants in terms of the solution quality and the stability.

[1]  Hamid R. Tizhoosh,et al.  Applying Opposition-Based Ideas to the Ant Colony System , 2007, 2007 IEEE Swarm Intelligence Symposium.

[2]  Hui Wang,et al.  Opposition-based particle swarm algorithm with cauchy mutation , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

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

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

[6]  M.M.A. Salama,et al.  Opposition-Based Differential Evolution , 2008, IEEE Transactions on Evolutionary Computation.

[7]  Yang Hua.  Group Search Optimizer Applying Opposition-based Learning , 2012 .

[8]  Hamid R. Tizhoosh,et al.  Opposition-Based Learning: A New Scheme for Machine Intelligence , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).