Table - PMC

Skip to main content

View full-text article in PMC

. 2026 Jan 26;26(3):824. doi: 10.3390/s26030824

Algorithm 1 ARO Algorithm.

1:
Initialization of:
2:
$P o p \leftarrow P o p_{1, 1} \dots P o p_{K, V}$
3:
$i t r \leftarrow 1$
4:
$M a x_{i t r}$
5:
Find $P o p_{b e s t}$ according to Equation (8)
6:
while $i t r < M a x_{i t r}$ do
7:
for every $P o p$ do
8:
Select the guide rabbits from $P o b$
9:
Calculate $A q (i t r)$
10:
if $A q (i t r)$ > 1 then
11:
Update $P o p_{b e s t}$ according to Equation (15)
12:
else
13:
Update $P o p_{b e s t}$ according to Equation (25)
14:
end if
15:
end for
16:
Update $P o p_{b e s t}$ according to Equation (8)
17:
end while