4.7 Article

Hybrid Particle Swarm and Grey Wolf Optimizer and its application to clustering optimization

期刊

APPLIED SOFT COMPUTING
卷 101, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2020.107061

关键词

Intelligence Optimization Algorithm; Grey Wolf Optimizer; Particle Swarm Optimization algorithm; Hybrid algorithm; K-means clustering

资金

  1. Key Research Projects of Higher Education Institutions of Henan Province, China [19A520026]
  2. National Natural Science Foundation of China [U1904123]

向作者/读者索取更多资源

The paper proposes a novel hybrid algorithm based on PSO and GWO, named HGWOP, which integrates the advantages of GWO's strong exploitation ability and PSO's global search ability to overcome their shortcomings and maximize overall performance. Experimental results demonstrate that HGWOP outperforms several state-of-the-art algorithms in terms of optimization performance and universality.
Grey Wolf Optimizer (GWO) and Particle Swarm Optimization (PSO) algorithm are two popular swarm intelligence optimization algorithms and these two algorithms have their own search mechanisms. Based on their unique search mechanisms and their advantages after the improvements on them, this paper proposes a novel hybrid algorithm based on PSO and GWO (Hybrid GWO with PSO, HGWOP). Firstly, GWO is simplified and a novel differential perturbation strategy is embedded in the search process of the simplified GWO to form a Simplified GWO with Differential Perturbation (SDPGWO) so that it can improve the global search ability while retaining the strong exploitation ability of GWO. Secondly, a stochastic mean example learning strategy is applied to PSO to create a Mean Example Learning PSO (MELPSO) to enhance the global search ability of PSO and prevent the algorithm from falling into local optima. Finally, a poor-for-change strategy is proposed to organically integrate SDPGWO and MELPSO to obtain an efficient hybrid algorithm of GWO and PSO. HGWOP can give full play to the advantages of these two improved algorithms, overcome the shortcomings of GWO and PSO and maximize the whole performance. A large number of experiments on the complex functions from CEC2013 and CEC2015 test sets reveal that HGWOP has better optimization performance and stronger universality compared with quite a few state-of-the-art algorithms. Experimental results on K-means clustering optimization show that HGWOP has obvious advantages over the comparison algorithms. (C) 2020 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据