1.背景
2022年,L Abualigah等人受到鳄鱼狩猎行为启发,提出了爬行动物搜索算法(Reptile Search Algorithm, RSA)。
2.算法原理
2.1算法思想
RSA主要分为围捕阶段和狩猎阶段。 围捕阶段的策略是高空行走和腹部行走,负责全局搜索;狩猎阶段的策略是协调狩猎和合作狩猎,负责局部勘探。
2.2算法过程
围捕阶段:
根据包围捕猎的行为,鳄鱼在包围阶段有两种策略,分别为离地行走和贴地行走。
x
(
i
,
j
)
=
{
B
e
s
t
j
(
t
)
−
η
(
i
,
j
)
(
t
)
×
β
−
R
(
i
,
j
)
(
t
)
×
r
,
t
≤
T
4
B
e
s
t
j
(
t
)
×
x
(
r
1
,
j
)
×
E
S
(
t
)
×
r
,
T
4
<
t
≤
T
2
(1)
x_{(i,j)}=\begin{cases}\mathrm{Best}_j(t)-\eta_{(i,j)}(t)\times\beta-R_{(i,j)}(t)\times r, \mathrm{t}\leq\dfrac{T}{4}\\\\\mathrm{Best}_j(t)\times x_{(r_1,j)}\times\mathrm{ES}(t)\times r,\quad\dfrac{T}{4}<\mathrm{t}\leq\dfrac{T}{2}\end{cases}\tag{1}
x(i,j)=⎩
⎨
⎧Bestj(t)−η(i,j)(t)×β−R(i,j)(t)×r,t≤4TBestj(t)×x(r1,j)×ES(t)×r,4T<t≤2T(1)
其中,各参数表述为:
η
(
i
,
j
)
(
t
)
=
B
e
s
t
j
(
t
)
×
P
(
i
,
j
)
R
(
i
,
j
)
=
B
e
s
t
j
(
t
)
−
x
(
r
2
,
j
)
B
e
s
t
j
(
t
)
+
ε
E
S
(
t
)
=
2
×
r
3
×
(
1
−
t
T
)
(2)
\begin{gathered} \eta_{(i,j)}(t)=\mathrm{Best}_{j}(t)\times P_{(i,j)} \\ R_{(i,j)}=\frac{\mathrm{Best}_{j}(t)-x_{(r_{2},j)}}{\mathrm{Best}_{j}(t)+\varepsilon} \\ \mathrm{ES}(t)=2\times r_{3}\times(1-\frac{t}{T}) \end{gathered}\tag{2}
η(i,j)(t)=Bestj(t)×P(i,j)R(i,j)=Bestj(t)+εBestj(t)−x(r2,j)ES(t)=2×r3×(1−Tt)(2)
P(i,j)表示最优解和当前解的百分比差异:
P
(
i
,
j
)
=
α
+
x
(
i
,
j
)
−
M
(
x
i
)
B
e
s
t
j
(
t
)
×
(
U
B
j
−
L
B
j
)
+
ε
(3)
P_{(i,j)}=\alpha+\frac{x_{(i,j)}-M(x_i)}{\mathrm{Best}_j(t)\times(\mathrm{UB}_j-\mathrm{LB}_j)+\varepsilon}\tag{3}
P(i,j)=α+Bestj(t)×(UBj−LBj)+εx(i,j)−M(xi)(3)
M
(
x
i
)
=
1
n
∑
j
=
1
n
x
(
i
,
j
)
(4)
M(x_i)=\frac{1}{n}\sum_{j=1}^nx_{(i,j)}\tag{4}
M(xi)=n1j=1∑nx(i,j)(4)
狩猎阶段:
鳄鱼的捕食过程中也有两种策略,狩猎协调与狩猎合作。
x
(
i
,
j
)
(
t
+
1
)
=
{
B
e
s
t
j
(
t
)
×
P
(
i
,
j
)
×
r
,
T
4
<
t
≤
3
T
4
B
e
s
t
j
(
t
)
−
η
(
i
,
j
)
(
t
)
×
ε
−
R
(
i
,
j
)
(
t
)
×
r
,
3
T
4
<
t
≤
T
(5)
\left.x_{(i,j)}(t+1)=\left\{\begin{array}{ll}\mathrm{Best}_j(t)\times P_{(i,j)}\times r,&\frac{T}{4}<\mathrm{t}\leq\frac{3T}{4}\\\\\mathrm{Best}_j(t)-\eta_{(i,j)}(t)\times\varepsilon-R_{(i,j)}(t)\times r,&\frac{3T}{4}<\mathrm{t}\leq T\end{array}\right.\right.\tag{5}
x(i,j)(t+1)=⎩
⎨
⎧Bestj(t)×P(i,j)×r,Bestj(t)−η(i,j)(t)×ε−R(i,j)(t)×r,4T<t≤43T43T<t≤T(5)
伪代码:
流程图:
3.结果展示
4.参考文献
[1] Abualigah L, Abd Elaziz M, Sumari P, et al. Reptile Search Algorithm (RSA): A nature-inspired meta-heuristic optimizer[J]. Expert Systems with Applications, 2022, 191: 116158.