文件名称:1
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:294.34kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
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.
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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Frankensteins_PSO_A_Composite_Particle_Swarm_Optimization_Algorithm-Xkr.pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.