Enhancing three variants of harmony search algorithm for continuous optimization problems
Meta-heuristic algorithms are well-known optimization methods, for solving real-world optimization problems. Harmony search (HS) is a recognized meta-heuristic algorithm with an efficient exploration process. But the HS has a slow convergence rate, which causes the algorithm to have a weak exploitat...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Advanced Engineering and Science (IAES)
2021
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/31374/ http://umpir.ump.edu.my/id/eprint/31374/1/Enhancing%20three%20variants%20of%20harmony%20search%20algorithm%20for%20continuous.pdf |
| _version_ | 1848823753104949248 |
|---|---|
| author | Alomoush, Alaa A. Alsewari, Abdulrahman A. Kamal Z., Zamli Alrosan, Ayat Alomoush, Waleed Alissa, Khalid |
| author_facet | Alomoush, Alaa A. Alsewari, Abdulrahman A. Kamal Z., Zamli Alrosan, Ayat Alomoush, Waleed Alissa, Khalid |
| author_sort | Alomoush, Alaa A. |
| building | UMP Institutional Repository |
| collection | Online Access |
| description | Meta-heuristic algorithms are well-known optimization methods, for solving real-world optimization problems. Harmony search (HS) is a recognized meta-heuristic algorithm with an efficient exploration process. But the HS has a slow convergence rate, which causes the algorithm to have a weak exploitation process in finding the global optima. Different variants of HS introduced in the literature to enhance the algorithm and fix its problems, but in most cases, the algorithm still has a slow convergence rate. Meanwhile, opposition-based learning (OBL), is an effective technique used to improve the performance of different optimization algorithms, including HS. In this work, we adopted a new improved version of OBL, to improve three variants of Harmony Search, by increasing the convergence rate speed of these variants and improving overall performance. The new OBL version named improved opposition-based learning (IOBL), and it is different from the original OBL by adopting randomness to increase the solution's diversity. To evaluate the hybrid algorithms, we run it on benchmark functions to compare the obtained results with its original versions. The obtained results show that the new hybrid algorithms more efficient compared to the original versions of HS. A convergence rate graph is also used to show the overall performance of the new algorithms. |
| first_indexed | 2025-11-15T03:02:08Z |
| format | Article |
| id | ump-31374 |
| institution | Universiti Malaysia Pahang |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T03:02:08Z |
| publishDate | 2021 |
| publisher | Institute of Advanced Engineering and Science (IAES) |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | ump-313742021-06-30T05:07:55Z http://umpir.ump.edu.my/id/eprint/31374/ Enhancing three variants of harmony search algorithm for continuous optimization problems Alomoush, Alaa A. Alsewari, Abdulrahman A. Kamal Z., Zamli Alrosan, Ayat Alomoush, Waleed Alissa, Khalid QA76 Computer software Meta-heuristic algorithms are well-known optimization methods, for solving real-world optimization problems. Harmony search (HS) is a recognized meta-heuristic algorithm with an efficient exploration process. But the HS has a slow convergence rate, which causes the algorithm to have a weak exploitation process in finding the global optima. Different variants of HS introduced in the literature to enhance the algorithm and fix its problems, but in most cases, the algorithm still has a slow convergence rate. Meanwhile, opposition-based learning (OBL), is an effective technique used to improve the performance of different optimization algorithms, including HS. In this work, we adopted a new improved version of OBL, to improve three variants of Harmony Search, by increasing the convergence rate speed of these variants and improving overall performance. The new OBL version named improved opposition-based learning (IOBL), and it is different from the original OBL by adopting randomness to increase the solution's diversity. To evaluate the hybrid algorithms, we run it on benchmark functions to compare the obtained results with its original versions. The obtained results show that the new hybrid algorithms more efficient compared to the original versions of HS. A convergence rate graph is also used to show the overall performance of the new algorithms. Institute of Advanced Engineering and Science (IAES) 2021-06 Article PeerReviewed pdf en cc_by_sa_4 http://umpir.ump.edu.my/id/eprint/31374/1/Enhancing%20three%20variants%20of%20harmony%20search%20algorithm%20for%20continuous.pdf Alomoush, Alaa A. and Alsewari, Abdulrahman A. and Kamal Z., Zamli and Alrosan, Ayat and Alomoush, Waleed and Alissa, Khalid (2021) Enhancing three variants of harmony search algorithm for continuous optimization problems. International Journal of Electrical and Computer Engineering (IJECE), 11 (3). pp. 2343-2349. ISSN 2088-8708. (Published) http://doi.org/10.11591/ijece.v11i3.pp2343-2349 http://doi.org/10.11591/ijece.v11i3.pp2343-2349 |
| spellingShingle | QA76 Computer software Alomoush, Alaa A. Alsewari, Abdulrahman A. Kamal Z., Zamli Alrosan, Ayat Alomoush, Waleed Alissa, Khalid Enhancing three variants of harmony search algorithm for continuous optimization problems |
| title | Enhancing three variants of harmony search algorithm for continuous optimization problems |
| title_full | Enhancing three variants of harmony search algorithm for continuous optimization problems |
| title_fullStr | Enhancing three variants of harmony search algorithm for continuous optimization problems |
| title_full_unstemmed | Enhancing three variants of harmony search algorithm for continuous optimization problems |
| title_short | Enhancing three variants of harmony search algorithm for continuous optimization problems |
| title_sort | enhancing three variants of harmony search algorithm for continuous optimization problems |
| topic | QA76 Computer software |
| url | http://umpir.ump.edu.my/id/eprint/31374/ http://umpir.ump.edu.my/id/eprint/31374/ http://umpir.ump.edu.my/id/eprint/31374/ http://umpir.ump.edu.my/id/eprint/31374/1/Enhancing%20three%20variants%20of%20harmony%20search%20algorithm%20for%20continuous.pdf |