4.7 Article

Biomimicry of parasitic behavior in a coevolutionary particle swarm optimization algorithm for global optimization

期刊

APPLIED SOFT COMPUTING
卷 32, 期 -, 页码 224-240

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2015.03.050

关键词

Coevolution; Global optimization; Parasitic behavior; Particle swarm optimization; Population diversity

资金

  1. National Natural Science Foundation of China [71240015, 71402103, 61273367, 71271140, 71001072]
  2. National Science Foundation of SZU [836]
  3. Foundation for Distinguished Young Talents in Higher Education of Guangdong, China [2012WYM_0116]
  4. MOE Youth Foundation Project of Humanities and Social Sciences at Universities in China [13YJC630123]
  5. Youth Foundation Project of Humanities and Social Sciences in Shenzhen University [14QNFC28]
  6. Ningbo Science & Technology Bureau [2012810055]

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

The declining of population diversity is often considered as the primary reason for solutions falling into the local optima in particle swarm optimization (PSO). Inspired by the phenomenon that parasitic behavior is beneficial to the natural ecosystem for the promotion of its biodiversity, this paper presents a novel coevolutionary particle swarm optimizer with parasitic behavior (PSOPB). The population of PSOPB consists of two swarms, which are host swarm and parasite swarm. The characteristics of parasitic behavior are mimicked from three aspects: the parasites getting nourishments from the host, the host immunity, and the evolution of the parasites. With a predefined probability, which reflects the characteristic of the facultative parasitic behavior, the two swarms exchange particles according to particles' sorted fitness values in each swarm. The host immunity is mimicked through two ways: the number of exchange particles is linearly decreased over iterations, and particles in the host swarm can learn from the global best position in the parasite swarm. Two mutation operators are utilized to simulate two aspects of the evolution of the parasites in PSOPB. In order to embody the law of survival of the fittest in biological evolution, the particles with poor fitness in the host swarm are removed and replaced by the same numbers of randomly initialized particles. The proposed algorithm is experimentally validated on a set of 21 benchmark functions. The experimental results show that PSOPB performs better than other eight popular PSO variants in terms of solution accuracy and convergence speed. (C) 2015 Elsevier B.V. All rights reserved.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据