Algorithm 2 BSO-I

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:   $\overrightarrow{y}=\overrightarrow{x}+\overrightarrow{z}$, where $\overrightarrow{z}$ is the mutation operator; 4:   if $\overrightarrow{y}$ adapts better than $\overrightarrow{x}$ then 5:      $\overrightarrow{x}$ is substituted for $\overrightarrow{y}$ 6:   end if 7:end while Output:  $\overrightarrow{x}$