전기학회논문지P (The Transactions of the Korean Institute of Electrical Engineers P)

  • 제67권3호
  • /
  • Pages.131-136
  • /
  • 2018
  • /
  • 1229-800X(pISSN)
  • /
  • 2586-7792(eISSN)
대한전기학회 (The Korean Institute of Electrical Engineers)
권호 표지
DOI QR코드

DOI QR Code

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

HS Optimization Implementation Based on Tuning without Maximum Number of Iterations

  • Lee, Tae-bong (School of Electronic Engineering, Gachon University)
  • 투고 : 2018.08.09
  • 심사 : 2018.08.16
  • 발행 : 2018.09.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드

참고문헌

  1. Z. W. Geem, J. H. Kim, and G. V. Loganathan, "A new heuristic optimization algorithm: Harmony search," J. Simul., vol. 76, no. 2, pp. 60-68, Feb. 2001. https://doi.org/10.1177/003754970107600201
  2. M. Mahdavi, M. Fesanghary, and E. Damangir, "An improved harmony search algorithm for solving optimization problems," Appl. Math. Comput., vol. 188, no. 2, pp. 1567-1579, May 2007. https://doi.org/10.1016/j.amc.2006.11.033
  3. F. Zhao, Y. Liu, C. Zhang, and J. Wang, "A self-adaptive harmony PSO search algorithm and its performance analysis," Expert Syst. Appl., vol. 42, no. 21, pp. 7436-7455, 2015. https://doi.org/10.1016/j.eswa.2015.05.035
  4. H.-B. O. Yang, L.-Q. Gao, S. Li, X. Kong, and D.-X. Zou, "On the iterative convergence of harmony search algorithm and a proposed modification," Appl. Math. Comput., vol. 247, pp. 1064-1095, Nov. 2014.
  5. S. A. Patil and D. A. Patel, "An overview: Improved harmony search algorithm and its applications in mechanical engineering," Int. J. Eng. Sci. Innov. Technol., vol. 2, no. 1, pp. 433-444, 2013.
  6. P. Chakraborty, G. G. Roy, S. Das, D. Jain, and A. Abraham, "An improved harmony search algorithm with differential mutation operator," Fundam. Inform., vol. 95, no. 4, pp. 401-426, 2009.
  7. L. Wang and L.-P. Li, "An effective differential harmony search algorithm for the solving non-convex economic load dispatch problems," Int. J. Elect. Power Energy Syst., vol. 44, no. 1, p. 832-843, 2013. https://doi.org/10.1016/j.ijepes.2012.08.021
  8. B. H. F. Hasan, I. A. Doush, E. Al-Maghayreh, F. Alkhateeb, and M. Hamdan, "Hybridizing harmony search algorithm with different mutation operators for continuous problems," Appl. Math. Comput., vol. 232, pp. 1166-1182, Apr. 2014.
  9. Edgar Alfredo Portilla-Flores, Alvaro S nchez-M rquez, Leticia Flores-Pulido, Eduardo Vega-Alvarado, Maria Barbara Calva Yanez, Jorge Alexander Aponte-Rodriguez, and Paola Andrea Nino-Suarez, "Enhancing the Harmony Search Algorithm Performance on Constrained Numerical Optimization," IEEE Access, vol. 5, pp. 25759-25779, 2017. https://doi.org/10.1109/ACCESS.2017.2771741
  10. A. E. Eiben and C. A. Schippers, "On evolutionary exploration and exploitation," Fundamenta Informaticae, vol. 35, no. 1-4, pp. 1-16, Aug. 1998.