1.背景
2021年，Naruei等人受到自然界中白骨顶鸡生存行为启发，提出了白骨顶鸡优化算法（Coot Optimization Algorithm, COOT）。
2.算法原理
2.1算法思想
COOT将搜索过程模拟成白骨顶鸡在水面有规律或无规律运动过程，实现了个体随机移动、链式移动、跟随领导者移动、领导者移动的四种不同的水面移动方式。
2.2算法过程
随机移动：
Q
=
r
a
n
d
(
1
,
D
)
⋅
(
u
b
−
l
b
)
+
l
b
C
o
o
t
p
o
s
(
i
)
=
C
o
o
t
p
o
s
(
i
)
+
A
⋅
R
2
⋅
(
Q
−
C
o
o
t
p
o
s
(
i
)
)
(1)
\begin{gathered}Q=rand(1,D)\cdot(ub-lb)+lb\\Cootpos(i)=Cootpos(i)+A\cdot R_2\cdot(Q-Cootpos(i))\end{gathered}\tag{1}
Q=rand(1,D)⋅(ub−lb)+lbCootpos(i)=Cootpos(i)+A⋅R2⋅(Q−Cootpos(i))(1)
A 的计算公式为:
A
=
1
−
t
T
(2)
A=1-\frac{t}{T}\tag{2}
A=1−Tt(2)
链式移动：
链式移动使用两只白骨顶鸡的位置计算平均值：
Cootpos(i)=0.5 (Cootpos(i-1)+ Cootpos(i))
(3)
\text{Cootpos(i)=0.5 (Cootpos(i-1)+ Cootpos(i))}\tag{3}
Cootpos(i)=0.5 (Cootpos(i-1)+ Cootpos(i))(3)
跟随领导者移动：
白骨顶鸡个体根据群体领导者更新它们的位置，逐渐靠近领导者：
K
=
1
+
(
i
M
O
D
N
L
)
(4)
K=1+(iMODN_{_L})\tag{4}
K=1+(iMODNL)(4)
K 表示选定的第 K 个领导者，NL 是领导者的数量。
跟随领导者移动：
C
o
o
t
p
o
s
(
i
)
=
L
e
a
d
e
r
P
o
s
(
K
)
+
2
⋅
R
1
⋅
c
o
s
(
2
R
π
)
⋅
(
L
e
a
d
e
r
P
o
s
(
K
)
−
C
o
o
t
p
o
s
(
i
)
)
(5)
\begin{aligned} Cootpos(i)= LeaderPos(K)+2\cdot R_{1}\cdot cos(2R\pi) \cdot(LeaderPos(K)-Cootpos(i)) \end{aligned}\tag{5}
Cootpos(i)=LeaderPos(K)+2⋅R1⋅cos(2Rπ)⋅(LeaderPos(K)−Cootpos(i))(5)
领导者移动：
领导者向当前最优的邻域移动：
L
e
a
d
e
r
P
o
s
(
i
)
=
{
B
⋅
R
3
⋅
c
o
s
(
2
R
π
)
⋅
(
g
B
e
s
t
−
L
e
a
d
e
r
P
o
s
(
i
)
)
+
g
R
e
r
.
if
R
4
<
0.5
B
⋅
R
3
⋅
c
o
s
(
2
R
π
)
⋅
(
g
B
e
s
t
−
L
e
a
d
e
r
P
o
s
(
i
)
)
−
g
R
e
r
,
otherwise
(6)
LeaderPos(i)=\begin{cases}B\cdot R_3\cdot cos(2R\pi)\cdot(gBest-LeaderPos(i))+g_{_{Rer}}.\text{if}R_4<0.5\\B\cdot R_3\cdot cos(2R\pi)\cdot(gBest-LeaderPos(i))-g_{_{Rer}},\text{otherwise}\end{cases}\tag{6}
LeaderPos(i)={B⋅R3⋅cos(2Rπ)⋅(gBest−LeaderPos(i))+gRer.ifR4<0.5B⋅R3⋅cos(2Rπ)⋅(gBest−LeaderPos(i))−gRer,otherwise(6)
伪代码：
3.结果展示
4.参考文献
[1] Naruei I, Keynia F. A new optimization method based on COOT bird natural life model[J]. Expert Systems with Applications, 2021, 183: 115352.
532
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
