الگوریتم جستجو PSO هماهنگی خود انطباقی و تجزیه و تحلیل عملکرد آن
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|44282||2015||20 صفحه PDF||سفارش دهید||12037 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Expert Systems with Applications, Volume 42, Issue 21, 30 November 2015, Pages 7436–7455
Harmony Search (HS) algorithm is a new population-based meta-heuristic which imitates the music improvisation process and has been successfully applied to a variety of combination optimization problems. In this paper, a self-adaptive harmony particle swarm optimization search algorithm, named SHPSOS, is proposed to solve global continuous optimization problems. Firstly, an efficient initialization scheme based on the PSO algorithm is presented for improving the solution quality of the initial harmony memory (HM). Secondly, a new self-adaptive adjusting scheme for pitch adjusting rate (PAR) and distance bandwidth (BW), which can balance fast convergence and large diversity during the improvisation step, are designed. PAR is dynamically adapted by symmetrical sigmoid curve, and BW is dynamically adjusted by the median of the harmony vector at each generation. Meanwhile, a new effective improvisation scheme based on differential evolution and the best harmony (best individual) is developed to accelerate convergence performance and to improve solution accuracy. Besides, Gaussian mutation strategy is presented and embedded in the SHPSOS algorithm to reinforce the robustness and avoid premature convergence in the evolution process of candidates. Finally, the global convergence performance of the SHPSOS is analyzed with the Markov model to testify the stability of algorithm. Experimental results on thirty-two standard benchmark functions demonstrate that SHPSOS outperforms original HS and the other related algorithms in terms of the solution quality and the stability.