An Improved Adaptive Harmony Search Algorithm

DOI

10.2991/iccse-15.2015.11How to use a DOI?

Keywords

Harmony search algorithm; Local optimization; Global optimization; adaptive

Abstract

Harmony search (HS) algorithm is a heuristic optimization algorithm which is newly developed in recent years. In this paper, according to the shortcomings of the existing harmony search algorithm, an improved adaptive harmony search algorithm (IAHS) is proposed. In the IAHS algorithm, the adaptive parameters HMCR and PAR and BW are used to adjust the global and local search, so as to improve the robustness and speed of convergence of the algorithm. IAHS algorithm is tested by five standard benchmark functions and contrasted with HS HIS and GHS algorithm. Experimental results demonstrated that the proposed IAHS algorithm has the favorable abilities of accuracy and escaping local minimums.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhang Li-min
PY  - 2015/07
DA  - 2015/07
TI  - An Improved Adaptive Harmony Search Algorithm
BT  - Proceedings of the 2015 International Conference on Computational Science and Engineering
PB  - Atlantis Press
SP  - 54
EP  - 59
SN  - 2352-538X
UR  - https://doi.org/10.2991/iccse-15.2015.11
DO  - 10.2991/iccse-15.2015.11
ID  - Li-min2015/07
ER  -