Algorithm 2. The pseudocode of ARO

Inputs: number of search agents ($N$), number of iterations ($m_i$), problem dimension ($d$), and lower ($LB$) and upper ($UB$) boundaries of search space

Outputs: the best rabbit ($X_B$) and its fitness ($F_B$)

//Initialization

$i=1$

while ($i\le N$)

Initialize $X_i$ by Equation (16)

Calculate $F_i$

$i=i+1$

end for

Find $X_B$ and $F_B$

$c_i= 1$

while ($c_i<m_i$)

$i=1$

while ($i\le N$)

Calculate energy shrink ($A$) by Equation (17)

if $A>1$

//Detour foraging

Update $X_i$ using Equation (19)

else

//Random hiding

Update $X_i$ using Equation (27)

end if

Compute $F_i$

$i=i+1$

end for

Update $X_B$ and $F_B$

$c_i= c_i+ 1$

end while

Return $X_B$ and $F_B$