Algorithm 3 Pseudocode of the crossover operator.

function Crossover($Q,P_c$)   $Q^{\prime }\leftarrow \varnothing$   for all $\{\overrightarrow{x},\overrightarrow{y}\}\in Q$ do           ▹ all the individuals in Q, taken in pairs    ${\overrightarrow{x}}^{\prime }=\overrightarrow{x}$    ${\overrightarrow{y}}^{\prime }=\overrightarrow{y}$    if $rnd\left(\right)<P_c$ then                    ▹ crossover probability     $p\leftarrow randInt(1,L)$    ▹ crossing point p, L is the length of the solution vector     for $i\leftarrow p,L$ do                      ▹i goes from p to L      if $is\_an\_int\_parameter\left(i\right)$then        ▹ type of the i-th parameter       ${\overrightarrow{x}}^{\prime }\left[i\right]=\overrightarrow{y}\left[i\right]$       ${\overrightarrow{y}}^{\prime }\left[i\right]=\overrightarrow{x}\left[i\right]$      else       $M\leftarrow randInt(1,10)$       ${\Delta }_x\leftarrow \overrightarrow{x}\left[i\right]/M$       ${\Delta }_y\leftarrow \overrightarrow{y}\left[i\right]/M$       ${\overrightarrow{x}}^{\prime }\left[i\right]=\overrightarrow{x}\left[i\right]+{\Delta }_y-{\Delta }_x$       ${\overrightarrow{y}}^{\prime }\left[i\right]=\overrightarrow{y}\left[i\right]-{\Delta }_y+{\Delta }_x$      end if     end for    end if    $Q^{\prime }\leftarrow Q^{\prime }\cup \{{\overrightarrow{x}}^{\prime },{\overrightarrow{y}}^{\prime }\}$   end for   return $Q^{\prime }$  end function