A new HMCR parameter of harmony search for better exploration
As a meta-heuristic algorithm, Harmony Search (HS) algorithm is a population-based meta-heuristics approach that is superior in solving diversified large scale optimization problems. Several studies have pointed that Harmony Search (HS) is an efficient and flexible tool to resolve optimization probl...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/556/1/FH03-FIK-16-05251.jpg http://eprints.unisza.edu.my/556/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Sultan Zainal Abidin |
| Language: | English |
| Summary: | As a meta-heuristic algorithm, Harmony Search (HS) algorithm is a population-based meta-heuristics approach that is superior in solving diversified large scale optimization problems. Several studies have pointed that Harmony Search (HS) is an efficient and flexible tool to resolve optimization problems in diversed areas of construction, engineering, robotics, telecommunication, health and energy. In this respect, the three main operators in HS, namely the Harmony Memory Consideration Rate (HMCR), Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing the local exploitation and the global exploration. These parameters influence the overall performance of HS algorithm, and therefore it is very crucial to fine turn them. However, when performing a local search, the harmony search algorithm can be easily trapped in the local optima. Therefore, there is a need to improve the fine tuning of the parameters. This research focuses on the HMCR parameter adjustment strategy using step function with combined Gaussian distribution function to enhance the global optimality of HS. The result of the study showed a better global optimum in comparison to the standard HS. |
|---|