赞
踩
基于蜣螂的滚球、跳舞、觅食、偷窃和繁殖行为,提出了一种新的基于种群的蜣螂优化器(DBO)算法。新提出的DBO算法兼顾了全局探索和局部探索,具有收敛速度快、求解精度满意的特点。该成果于2022年发表在知名SCI期刊THE JOURNAL OF SUPERCOMPUTING上。
x
i
(
t
+
1
)
=
x
i
(
t
)
+
α
×
k
×
x
i
(
t
−
1
)
+
b
×
Δ
x
Δ
x
=
∣
x
i
(
t
)
−
X
w
∣
x i ( t + 1 ) = x i ( t ) + tan ( θ ) ∣ x i ( t ) − x i ( t − 1 ) ∣ x_{i}(t+1)=x_{i}(t)+\tan(\theta)|x_{i}(t)-x_{i}(t-1)| xi(t+1)=xi(t)+tan(θ)∣xi(t)−xi(t−1)∣
B i ( t + 1 ) = X ∗ + b 1 × ( B i ( t ) − L b ∗ ) + b 2 × ( B i ( t ) − U b ∗ ) B_{i}(t+1)=X^{*}+b_{1}\times(B_{i}(t)-L b^{*})+b_{2}\times(B_{i}(t)-U b^{*}) Bi(t+1)=X∗+b1×(Bi(t)−Lb∗)+b2×(Bi(t)−Ub∗)
x i ( t + 1 ) = x i ( t ) + C 1 × ( x i ( t ) − L b b ) + C 2 × ( x i ( t ) − U b b ) x_{i}(t+1)=x_{i}(t)+C_{1}\times(x_{i}(t)-L b^{b})+C_{2}\times(x_{i}(t)-U b^{b}) xi(t+1)=xi(t)+C1×(xi(t)−Lbb)+C2×(xi(t)−Ubb)
x i ( t + 1 ) = X b + S × g × ( ∣ x i ( t ) − X ∗ ∣ + ∣ x i ( t ) − X b ∣ ) x_{i}(t+1)=X^{b}+S\times g\times\left(|x_{i}(t)-X^{*}|+\left|x_{i}(t)-X^{b}\right|\right) xi(t+1)=Xb+S×g×(∣xi(t)−X∗∣+ xi(t)−Xb )

Copyright © 2003-2013 www.wpsshop.cn 版权所有,并保留所有权利。