이변수 다항식 문제에 대한 새로운 메타 휴리스틱 개발

Development of New Meta-Heuristic For a Bivariate Polynomial
  • 장성호; 
  • 권문수; 
  • 김근태; 
  • 이종환

초록

Meta-heuristic algorithms have been developed to efficiently solve difficult problems and obtain a global optimal solution. A common feature mimics phenomenon occurring in nature and reliably improves the solution through repetition. And at the same time, the probability is used to deviate from the regional optimal solution and approach the global optimal solution. This study compares the algorithm created based on the above common points with existed SA and HS to show advantages in time and accuracy of results. Existing algorithms have problems of low accuracy, high memory, long runtime, and ignorance. In a two-variable polynomial, the existing algorithms show that the memory increases and the accuracy decrease. In order to improve the accuracy, the new algorithm increases the number of initial inputs and increases the efficiency of the search by introducing a direction using vectors. And, in order to solve the optimization problem, the results of the last experiment were learned to show the learning effect in the next experiment. The new algorithm found a solution in a short time under the experimental conditions of long iteration counts using a two-variable polynomial and showed high accuracy. And, it shows that the learning effect is effective in repeated experiments.

키워드

Meta-Heuristic; Bivariate Polynomial; Simulated Annealing; Harmony Search
제목
이변수 다항식 문제에 대한 새로운 메타 휴리스틱 개발
제목 (타언어)
Development of New Meta-Heuristic For a Bivariate Polynomial
저자
장성호; 권문수; 김근태; 이종환
발행일
2021-06
저널명
산업경영시스템학회지
권
44
호
2
페이지
58 ~ 65