期刊
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
卷 14, 期 6, 页码 959-974出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TEVC.2010.2046667
关键词
Clustering; dynamic optimization problem (DOP); local search; multiswarm; particle swarm optimization
资金
- Engineering and Physical Sciences Research Council of U.K. [EP/E060722/1]
- EPSRC [EP/E060722/1] Funding Source: UKRI
- Engineering and Physical Sciences Research Council [EP/E060722/1] Funding Source: researchfish
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but also to track the trajectory of the changing optima over dynamic environments. To address this requirement, this paper investigates a clustering particle swarm optimizer (PSO) for dynamic optimization problems. This algorithm employs a hierarchical clustering method to locate and track multiple peaks. A fast local search method is also introduced to search optimal solutions in a promising subregion found by the clustering method. Experimental study is conducted based on the moving peaks benchmark to test the performance of the clustering PSO in comparison with several state-of-the-art algorithms from the literature. The experimental results show the efficiency of the clustering PSO for locating and tracking multiple optima in dynamic environments in comparison with other particle swarm optimization models based on the multiswarm method.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据