A New Variant Harmony Search Algorithm for Unconstrained Numerical Optimization Problems

Article Preview

Abstract:

Harmony search (HS) algorithm is a good meta-heuristic intelligent optimization method and it does depend on imitating the music improvisation process to generate a perfect state of harmony. However, intelligent optimization methods is easily trapped into local optimal, HS is no exception. In order to modify the optimization performance of HS, a new variant of harmony search algorithm is proposed in this paper. The variant integrate the position updating of the particle swarm optimization algorithm with pitch adjustment operation, and dynamically adjust the key parameter pitch adjusting rate (PAR) and bandwidth (BW). Several standard benchmarks are to be tested. The numerical results demonstrated the superiority of the proposed method to the HS and recently developed variants (IHS, and GHS).

You might also be interested in these eBooks

Info:

Periodical:

Pages:

174-177

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Geem Z W, Kim J H, Loganathan G V. A new heuristic optimization algorithm: Harmony search [J], Simulation, 2001, 76(2): 60-68.

DOI: 10.1177/003754970107600201

Google Scholar

[2] Mahdavi M, Fesanghary M, Damangir E. An improved harmony search algorithm for solving optimization problems [J], Applied Mathematics and Computation, 2007, 188(2): 1567–1579.

DOI: 10.1016/j.amc.2006.11.033

Google Scholar

[3] Chia-Ming Wang, Yin-Fu Huang. Self-adaptive harmony search algorithm for optimization. Expert Systems with Applications, 2010, 37(4): 2826-2837.

DOI: 10.1016/j.eswa.2009.09.008

Google Scholar

[4] Omran M G H, Mahdavi M. Global-best harmony search [J], Applied Mathematics and Computation, 2008, 198(2): 643-656.

DOI: 10.1016/j.amc.2007.09.004

Google Scholar

[5] Zou D X, Gao L Q, Wu J H, Li S. Novel global harmony search algorithm for unconstrained problems [J], Neurocomputing, 2010, 73(16-18): 3308-3318.

DOI: 10.1016/j.neucom.2010.07.010

Google Scholar