Algorithm 1 Pseudo Code of MIPOA

Start MIPOA. 1: Input information of optimization problem. 2: Determine the MIPOA population _size $(N)$ and the number of $\left(T\right)$. 3: Initialize problem setting ( $Dim$, $lb$, $ub)$. 4: Initialize of the position of pelicans using Equation (18) and calculate the objective function. 5: For  $t=1:T$ 6:     Generate the position of the prey at random. 7:     For  $i=1:N$ 8:     Phase 1: Search for prey and move towards it (exploration phase). 9:         For  $j=1:m$ 10:          Calculate new status of the $j$-th dimension using Equation (20). 11:        End. 10:        update the position of $ith$ pelican using Equation (24). 12:    Phase 2: Cruising and waiting, and hunting prey (exploitation phase). 13:        For  $j=1:m$ 14:          Calculate Cauchy using Equation (27). 15:          if $rand>0.5$ 16:           Calculate new status of the $jth$ dimension using Equation (25). 17:          else 18:           Calculate new status of the $jth$ dimension using Equation (28). 19:        End 20:        update the position of $ith$ pelican using Equation (29). 21:   End. 22:   Update best candidate solution. 23: End. 24: Output best candidate solution obtained by MIPOA. End MIPOA.