Algorithm 5: Ali et al. [7]

Step 1: Initialize $x_i,v_i$ for $i=1,2,\cdots ,S$         and set $p_i=x_i$ Step 2: Find $j=\left\{i|i=1,2,\cdots ,S\mathrm{and}J(p_i)\leftarrow \min \right\}$         Particle i best: $J_{min}^i\leftarrow J\left(p_i\right)$         Global best: $p_g\leftarrow p_j$ and $J_{min}\leftarrow J\left(p_j\right)$ Step 3: for each particle i do                 Update $x_i,v_i$ (47)                 Calculate $J\left(x_i\right)$ (45)                 if $J\left(x_i\right)<J_{min}^i$                    $J_{min}^i\leftarrow J\left(x_i\right)$ and $p_i\leftarrow x_i$                    if $J\left(x_i\right)<J_{min}$                        $J_{min}\leftarrow J\left(x_i\right)$ and $p_g\leftarrow x_i$ Step 4: Repeat Step 3 until an exit condition is met Step 5: Extract T and h from $p_g$ (48)