Algorithm 1 Pseudocode of the HSA-SCA metaheuristics

Spawn a collection of starting solutions $\left(X\right)$ while   $t<maxIter$   do    validate each individual in terms of its fitness    for each individual inside $\left(X\right)$ do      if $t<vs$ then         Perform SCA search mechanism, provided by Equation (7)      else         if $rnd<sm$ then           Perform SCA search mechanism, provided by Equation (7)         else           Perform FA search mechanism, provided by Equation (8)         end if      end if    end for end while return The current fittest solution determined as the global optimum