An analysis of the parameter modifications in varieties of harmony search algorithm
A Harmony Search (HS) algorithm is a population based-meta-heuristics approach that is superior in solving diversified and large scale optimization problems. Several studies have pointed out that Harmony Search is an efficient and flexible tool to resolve optimization problems in diverse areas of co...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Praise Worthy Prize
2014
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/5590/1/FH02-FIK-15-02359.jpg http://eprints.unisza.edu.my/5590/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A Harmony Search (HS) algorithm is a population based-meta-heuristics approach that is superior in solving diversified and large scale optimization problems. Several studies have pointed out that Harmony Search is an efficient and flexible tool to resolve optimization problems in diverse areas of construction, engineering, robotics, telecommunication, health and energy. Considering its increasing usage in diverse areas, this paper aims to present the historical development of HS, highlighting on its different features, modifications for improvements and limitations. Based on the description of the fundamental concept of HS, recent variations of the extended HS were analyzed focusing on its algorithm’s theory as well as its fundamental and primary concepts. It was found that the enhancements made on the extended HS are mainly on the modification of the parameters, such as the harmony memory consideration rate (HMCR), pitch adjusting rate (PAR) and distance bandwidth (BW). This analysis provides a useful motivation for researchers interested to improve the achievement of the standard HS algorithm and enhance the solution convergence rate and flexibility. |
|---|