Algorithm 1 Algorithm of WOA

Input: Number of whales (n), Max_Iter Output: Prey or the fittest whale $\mathrm{Generate}\mathrm{Initial}\mathrm{Population}Xi$$(i=1, 2, \dots , n$) Calculate the objective value of each solution      $X^{*}=the best solution$ while$(p<Max\_Iter$) for each solution $\mathrm{Update}s, K, J, l, and t$ if$(t<0.5$) if$(\left|K\right|<1$) Update the current solution’s position by Equation (5) else if$(\left|K\right|>1$) $\mathrm{Select}\mathrm{a}\mathrm{random}\mathrm{solution}(Xr$) Use Equation (12) end if else if$(t>=0.5$) Update the current solution’s position by the Equation (9) end if end for Check whether there is any solution present beyond the search space and update it Calculate each solution’s fitness $\mathrm{If}\mathrm{a}\mathrm{better}\mathrm{solution}\mathrm{is}\mathrm{found},\mathrm{update}{X}^{*}$      $p=p+1$ end while return X*