Algorithm 3 BSO-II

1:Initialization: Randomly generate an individual $\overrightarrow{x}=(x_1,x_2,\dots ,x_n)\in R^n$ based on uniform distribution; 2:while stopping criterion is not satisfied do 3:   Randomly generate a value $P{b}^{\prime }$ from 0 to 1 based on uniform distribution; 4:   if $P{b}^{\prime }$ is smaller than a pre-determined probability $Pb$ then 5:       replace $\overrightarrow{x}$ with a randomly generated individual $\overrightarrow{b}=(b_1,b_2,\dots ,b_n)$ based on uniform distribution; 6:   end if 7:   if $P{b}^{\prime }<Pb$ then 8:       $\overrightarrow{y}=\overrightarrow{b}+\overrightarrow{z}$, where $\overrightarrow{z}$ is a mutation operator; 9:   else 10:     $\overrightarrow{y}=\overrightarrow{x}+\overrightarrow{z}$; 11:  end if 12:  if $\overrightarrow{y}$ has better fitness than $\overrightarrow{x}$ then 13:      replace $\overrightarrow{x}$ with $\overrightarrow{y}$ 14:  end if 15: end while Output:  $\overrightarrow{x}$