이변수 다항식 문제에 대한 새로운 메타 휴리스틱 개발
Development of New Meta-Heuristic For a Bivariate Polynomial
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
Abstract
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.
참고문헌 (10)
- Bianchi, L., "A Survey on Metaheuristics for Stochastic Combinatorial Optimization", Natural Computing, 8, pp.239~287 (2009)
- Dorigo, M., "The Ant System : Optimization by a Colony of Cooperating Agents, Systems, Man, and Cybernetics, Part B: Cybernetics", IEEE Transactions on, 26(1), pp.29~41 (1996)
- Gao, X.Z, "Studies in Computational Intelligence", pp.39~51 (2009)
- Geem, Z. W., "A New Heuristic Optimization Algorithm : Harmony Search", Simulation, 76, pp.60~68 (2001)
- Kattanl, A, "Harmony Search Based Supervised Training of Artificial Neural Networks", International Conference of Intelligent Systems, Modelling And Simulation, pp.105~110 (2010)
- Kim, M.K, "Harmony Search Methods for Multi-Modal Optimization Using Optimal Vectors", Journal of Korea Institute of Electronics and Information Engineers, pp.2235~2238 (2010)
- 이상경, "Harmony Search 알고리즘의 수렴성 개선에 관한 연구", 한국지능시스템학회 논문지, 21(3), pp.401~406 (2011), 한국지능시스템학회
- Mahdavi, M., "An Improved Harmony Search Algorithm for Solving Optimization Problems", Applied Mathematics and Computation, 188(2), pp.1567~1579 (2007)
- Meta Heuristics that Mimics Natural Phenomenon, "Yoon, B.S.", Korean Institute of Industrial Engineers, 1~10 (2011)
- Yoon, H.Y, "Harmony Search Combined with Art Colony Optimization", Journal of Society of Korea Industrial and Systems Engineering, pp.1067~1074 (2013)