Hyperdize Jaya Algorithm for Harmony Search Algorithm's Parameters Selection
This paper present a successful method to tune the parameters of the harmony search algorithm, which is a well-known meta-heuristic algorithm. Choosing the values of HS parameters consider as a difficulty when we use it in different cases, and we tried to solve this problem by using another meta-heu...
Disimpan dalam:
| Pengarang-pengarang Utama: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Diterbitkan: |
Universiti Malaysia Pahang
2016
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://ee.ump.edu.my/ncon/wp-content/uploads/2016/10/Proceeding-NCON-PGR-2016.zip http://ee.ump.edu.my/ncon/wp-content/uploads/2016/10/Proceeding-NCON-PGR-2016.zip http://umpir.ump.edu.my/15757/1/P107%20pg788-791.pdf |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
| Ringkasan: | This paper present a successful method to tune the parameters of the harmony search algorithm, which is a well-known meta-heuristic algorithm. Choosing the values of HS parameters consider as a difficulty when we use it in different cases, and we tried to solve this problem by using another meta-heuristic algorithm to pick the right value for one of these parameters, which is harmony memory consideration rate. To evaluate the performance of the amended algorithm, we have applied it on different bench-mark functions that shows its good performance, in terms of result accuracy in contrast with the original algorithm Harmony Search with less number of iterations, and when we compare it with two other well-known variants of HS. |
|---|