Algorithm 1. Pseudocode of SSO algorithm

Initialise the population of social spiders

Initialise the target vibration

Initialise the parameters, $rand$ and $L$

Evaluate the fitness measure for all social spiders

For all social spiders,

{

Calculate the vibration intensity

Select the strongest vibration among all

{

$n_{\mathrm{int}}>t\arg e{t}_{\mathrm{int}}$

Store position of foraging spider $v$ as the best solution

}

While $q<q_{\max }$

{

Update the position of the foraging spider as per Equation (8)

}

End For

Update the parameters, $rand$ and $L$

Evaluate fitness of all social spiders

Sort the positions as per fitness measure (accuracy)

$q=q+1$

}

End For

Return $B_v^{q+1}$