p.150
p.155
p.160
p.165
p.170
p.174
p.178
p.182
p.186
Opposition-Based Improved Harmony Search Algorithm Solve Unconstrained Optimization Problems
Abstract:
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.
Info:
Periodical:
Pages:
170-173
Citation:
Online since:
August 2013
Authors:
Keywords:
Price:
Сopyright:
© 2013 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: