Home \ Metaheuristics \ Harmony Search in MATLAB

Harmony Search in MATLAB

Harmony Search (HS) is a global optimization algorithm which inspired by harmony improvisation process of musicians, proposed by Zong Woo Geem in 2001. Every solution in this algorithm is called a Harmony and there is an archive of promising solutions, called Harmony Memory (HM). For more information on Harmony Search, you can read the related article in Wikipedia (here).

At every iteration of Harmony Search, new harmonies are generated considering harmonies stored in the HM, with the probability of HMCR (harmony memory consideration rate), or using randomized elements, with the probability of 1-HMCR. After that, the pitch adjustment is performed. In this step, every component of solution (harmony) is deviated within a range called Fret Width (FW), just like the techniques used by musicians and instrument players (such as guitar and violin).

In this post,we are going to share with you, the open source implementation of Harmony Search (HS) in MATLAB. The algorithm is implemented in a structured manner and if you are familiar with MATLAB programming language, you will find it easy, to use the codes in your research projects.

Downloads

The download link of this project follows.

Implementation of Harmony Search (HS) in MATLAB

Download

Leave a Reply

Your email address will not be published. Required fields are marked *

*

x

Check Also

Artificial Bee Colony in MATLAB

Artificial Bee Colony (ABC) is a metaheuristic algorithm, inspired by foraging behavior of honey bee ...