최대 반복 횟수 없이 튜닝에 기반을 둔 HS 최적화 구현

• Published in: 전기학회 논문지 P권, 67(3) Vol. 67P; no. 3; pp. 131 - 136
• Main Author: 이태봉(Tae-bong Lee)
• Format: Journal Article
• Language: Korean
• Published: 대한전기학회 2018
• Subjects: 전기공학; Meta-heuristic; HS(harmony search); HMCR; Tuning
• ISSN: 1229-800X; 2586-7792

Harmony search (HS) is a relatively recently developed meta-heuristic optimization method imitating the music improvisation process where musicians improvise their instruments' pitches searching for a perfect state of harmony. In the conventional HS algorithm, it is necessary to determine the maximum number of iterations with some algorithm parameters. However, there is no criterion for determining the number of iterations, which is a very difficult problem. To solve this problem, a new method is proposed to perform the algorithm without setting the maximum number of iterations in this paper. The new method allows the algorithm to be performed until the desired tuning is achieved. To do this, a new variable bandwidth is introduced. In addition, the types and probability of harmonies composed of variables is analyzed to help to decide the value of HMCR. The performance of the proposed method is investigated and compared with classical HS. The experiments conducted show that the new method generally outperformed conventional HS when applied to seven benchmark problems.