Algorithm 6 FFA main steps

$\mathbf{Define}$: $N_v$, D, $f\left(x\right)$, $\gamma$, N $\mathbf{Generate}$ firefly positions $x_i$, $i=(1,\dots ,N_v)$ $\mathbf{Compute}$ emission light intensity $I_i$ using $f\left(x_i\right)$; t: = 1 while ($t\le N{G}_{max}$) and (solution not yet found) do    for i: = $1,\cdots ,N_v$ do      for j: = $1,\cdots ,N_v$ do         if ($I_j>I_i$) then           $\mathbf{Move}$ firefly i towards j         end if         $\mathbf{Compute}$ firefly perceived attraction         $\mathbf{Evaluate}$ solution via $f\left(x\right)$         $\mathbf{Update}$ light intensity      end for    end for    $\mathbf{Sort}$ fireflies;    t: = t + 1 end while $\mathbf{Return}$ best solution