粒子群优化的自适应部落拓扑
1. 传统粒子群优化算法(PSO)
传统的PSO算法是一种基于群体智能的优化算法,其伪代码如下:
Algorithm 1 Conventional PSO
1: procedure PSO(P , T , ω)
2:
Initialize population members
3:
for all i ∈P do
4:
Xi ←rand(D)
5:
Vi ←rand([2, D])
6:
end for
7:
Initialize c1, c2 according to Eq. (2)
8:
while t ̸= T do
9:
for all i ∈P do
10:
Vi,t+1 ←according to Eq. (1)
11:
Xi,t+1 ←Xi,t + Vi,t+1
12:
Ci,t+1 ←f (Xi,t+1)
13:
if Cbest
i
> Ci,t+1 then
14:
Cbest
i
, Xbest
i
←Ci,t+1, Xi,t+1
15:
if gbest > Ci,t+1 then
16:
gbest, Xbe
超级会员免费看
订阅专栏 解锁全文

被折叠的 条评论
为什么被折叠?



