在搜索目標函數最佳解的演算法領域中,粒子群優化演算法為簡單且有效的演算法。它的優點包括簡單且易於理解和實現,但其缺點是容易陷入區域最佳解中。為了保持原有的優點並提高其效能,我們在試著提出並驗證一個新穎的想法,這個構想乃是基於前期效能選擇最佳粒子群優化演算法的設定模型;設定模型的選擇是透過一種在具有多個設定模型的粒子群優化演算法中做切換。實驗結果證明,透過以此方案執行的粒子群優化演算法表現優於其它個別的模組設定。在未來,我們相信具備多模型選擇能力的粒子群優化演算法必將是富有前景的研究領域。此外,這個概念可以輕易地延伸到一種可從多個優化演算法中選擇最好的優化演算法的方案。
In the field of searching the optimal solutions of objective functions, particle swarm optimization (PSO) can be said to be a simple but effective algorithm. Its advantages include simplicity and ease to understand and implement, but it easily leads to getting stuck in local optima. In order to maintain the original benefit and promote its performance, we propose a novel idea in this paper, which selects the best setting model of PSO based on the previous performance through a switch of PSO with multiple setting models. Experimental results show that the PSO through the scheme is better than any with its individual setting alone. In the future, PSO algorithms with a switch of multiple models will be a promising research field. In addition, the idea can be easily extended to a scheme of selecting the best from multiple optimization methods.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。