4.7 Article

Frankenstein's PSO: A Composite Particle Swarm Optimization Algorithm

期刊

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
卷 13, 期 5, 页码 1120-1132

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TEVC.2009.2021465

关键词

Continuous optimization; experimental analysis; integration of algorithmic components; particle swarm optimization (PSO); run-time distributions; swarm intelligence

资金

  1. Programme Alaan
  2. European Union Programme of High Level Scholarships for Latin America [E05D054889MX]
  3. fund for scientific research, F.R.S-FNRS, of the French Community of Belgium

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

During the last decade, many variants of the original particle swarm optimization (PSO) algorithm have been proposed. In many cases, the difference between two variants can be seen as an algorithmic component being present in one variant but not in the other. In the first part of the paper, we present the results and insights obtained from a detailed empirical study of several PSO variants from a component difference point of view. In the second part of the paper, we propose a new PSO algorithm that combines a number of algorithmic components that showed distinct advantages in the experimental study concerning optimization speed and reliability. We call this composite algorithm Frankenstein's PSO in an analogy to the popular character of Mary Shelley's novel. Frankenstein's PSO performance evaluation shows that by integrating components in novel ways effective optimizers can be designed.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据