Review on the parameter settings in harmony search algorithm applied to combinatorial optimization problems
Harmony search algorithm (HSA) is relatively considered as one of the most recent metaheuristic algorithms. HSA is a modern - nature algorithm that simulates the musicians’ natural process of musical improvisation to enhance their instrument’s note to find a state of pleasant (harmony) according to...
שמור ב:
| Main Authors: | , , , |
|---|---|
| פורמט: | Article |
| יצא לאור: |
Institute of Advanced Engineering and Science
2022
|
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
| סיכום: | Harmony search algorithm (HSA) is relatively considered as one of the most recent metaheuristic algorithms. HSA is a modern - nature algorithm that simulates the musicians’ natural process of musical improvisation to enhance their instrument’s note to find a state of pleasant (harmony) according to aesthetic standards. Lots of variants of HSA have been suggested to tackle combinatorial optimization problems. They range from hybridizing some components of other metaheuristic approaches (to improve the HSA) to taking some concepts of HSA and utilizing them to improve other metaheuristic methods. This stud y reviews research pertaining to parameter settings of HSA and its applications to efficiently solve hard combinatorial optimization problems. |
|---|