Algorithm 1: An algorithm for the swimming method.

1:Input: $s{n}_{num}$, $N_s,$ $N_c$,$N_{re}$,$N_{ed}$, $P_{ed}$.

2:Output: New value of the ${\vartheta }^i\left(j+1,k,l\right)$ after swimming movement.

3: $counter=0;$ /*for computing swim length*/

4:  while $counter<N_s$ do /*for not exceeding the maximum number of swim steps */

5:     $counter=counter+1;$

6:     if $J\left(i,j+1,k,l\right)<J_{previous}$then /* a more advantageous direction*/

7:         $J_{previous}=J\left(i,j+1,k,l\right);$

8:         ${\vartheta }^i\left(j+1,k,l\right)={\vartheta }^i\left(j+1,k,l\right)+C\left(i\right)\frac{\Delta \left(i\right)}{\sqrt{{\Delta }_m\left(i\right)\Delta \left(i\right)}}$

9:     end if

10:  end while

11: return ${\vartheta }^i\left(j+1,k,l\right)$