Algorithm 4 Pseudocode of the mutation operator.

function Mutation($Q,P_m$)   $Q^{\prime }\leftarrow \varnothing$   for all $\left\{\overrightarrow{x}\right\}\in Q$do             ▹ all the individuals in Q    ${\overrightarrow{x}}^{\prime }\leftarrow \overrightarrow{x}$    for $i\leftarrow 1,L$ do  ▹i goes from 1 to L (the length of the solution vector)     if $rnd\left(\right)<P_m$ then            ▹ mutation probability      $M\leftarrow randInt(1,10)$      $\Delta \leftarrow getDelta(\overrightarrow{x}\left[i\right],M)$      if $rnd\left(\right)<0.5$ then           ▹ increment/decrement       $\Delta =-1\ast \Delta$      end if      ${\overrightarrow{x}}^{\prime }\left[i\right]\leftarrow \overrightarrow{x}\left[i\right]+\Delta$     end if    end for    $Q^{\prime }\leftarrow Q^{\prime }\cup \left\{{\overrightarrow{x}}^{\prime }\right\}$   end for   return $Q^{\prime }$  end function