Algorithms 1: Pseudo-code for WOA.

Initialize whale population ${\overrightarrow{X}}_i$ of $N_w$ and maximum number of iterations $t_{max}$ Calculate fitness of each search agent ${\overrightarrow{X}}_i$ Find initial best search agent ${\overrightarrow{X}}^{*}$ while ($t<t_{max}$)       for each search agent ${\overrightarrow{X}}_i$             Update $\overrightarrow{a}$, $\overrightarrow{A}$, $\overrightarrow{C}$, $l$ and $p$                   if ($p<0.5$)                         if ($\left|\overrightarrow{A}\right|<1$)                               Update ${\overrightarrow{X}}_i$ by Equation (11)                         else if ($\left|\overrightarrow{A}\right|\ge 1$)                               Randomly select ${\overrightarrow{X}}_{rand}$ from population                               Update ${\overrightarrow{X}}_i$ by Equation (17)                         end if                   else if ($p\ge 0.5$)                         Update ${\overrightarrow{X}}_i$ by Equation (14)                   end if             end for       Adjust all ${\overrightarrow{X}}_i$ if they are out of solution range       Calculate fitness of all ${\overrightarrow{X}}_i$       Update ${\overrightarrow{X}}^{*}$ if a better ${\overrightarrow{X}}_i$ is found       $t=t+1$ end while return ${\overrightarrow{X}}^{*}$