Dynamic Adaptive Harmony Search Algorithm for Optimization

Abstract:

Article Preview

A new meta-heuristic optimization algorithm–harmony search is conceptualized using the musical improvisation process of searching for a perfect state of harmony. Although several variants and an increasing number of applications have appeared, one of its main difficulties is how to select suitable parameter values. In this paper, we proposed a novel algorithm to dynamically adapt the harmony memory consideration rate (HMCR) and pitch adjustment rate (PAR) and distance bandwidth (BW). The experimental results revealed the superiority of the proposed method to the original HS, improved harmony search (IHS) and global-best harmony search (GHS).

Info:

Periodical:

Key Engineering Materials (Volumes 474-476)

Edited by:

Garry Zhu

Pages:

1666-1671

DOI:

10.4028/www.scientific.net/KEM.474-476.1666

Citation:

Y. W. Wang and M. Yao, "Dynamic Adaptive Harmony Search Algorithm for Optimization", Key Engineering Materials, Vols. 474-476, pp. 1666-1671, 2011

Online since:

April 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.