الگوریتم جستجوی هارمونی بهبودیافته جهانی برای بهینه سازی سریع تر
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|46780||2014||16 صفحه PDF||سفارش دهید||11760 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Expert Systems with Applications, Volume 41, Issue 13, 1 October 2014, Pages 5788–5803
In this paper, an improved global-best harmony search algorithm, named IGHS, is proposed. In the IGHS algorithm, initialization based on opposition-based learning for improving the solution quality of the initial harmony memory, a new improvisation scheme based on differential evolution for enhancing the local search ability, a modified random consideration based on artificial bee colony algorithm for reducing randomness of the global-best harmony search (GHS) algorithm, as well as two perturbation schemes for avoiding premature convergence, are integrated. In addition, two parameters of IGHS, harmony memory consideration rate and pitch adjusting rate, are dynamically updated based on a composite function composed of a linear time-varying function, a periodic function and a sign function in view of approximate periodicity of evolution in nature. Experimental results tested on twenty-eight benchmark functions indicate that IGHS is far better than basic harmony search (HS) algorithm and GHS. In further study, IGHS has also been compared with other eight well known metaheuristics. The results show that IGHS is better than or at least similar to those approaches on most of test functions.