Algorithm 1: SFMOABC

Input: the number of the food sources $N$; the dimension of problems $D$; a count parameter representing the number of times the current solution has not been improved $trail$; the maximum number of not be improved $limit$; the number of hub nodes in the scale-free network $m_0$; the number of edges when the node joins the network $m$. Output: the optimal solution $x$. 01. Initialize $N$ food sources to form a population $X=\left\{x_1,x_2,\cdots ,x_N\right\}$; 02. Calculate the fitness value of each solution $F(x)=\left\{f\left(x_1\right),f\left(x_2\right),\cdots ,f\left(x_N\right)\right\}$; 03. Build a scale-free network with $N$ node, and number each node in the network. 04. While the stopping criteria is not satisfied do 05.  for $i=1\to N$ do 06.   if $i<=m_0$ then 07.    $v_i=x_i$; 08.    Find the neighbor $nei$ with the largest degree of $x_i$; 09.    $v_{i,d}=x_{i,d}+rand\left(-1,1\right)\left(x_{i,d}-x_{k,d}\right)+rand\left(0,1\right)\left(x_{nei,d}-x_{i,d}\right)$ 10.    $k\in \left\{1,2,\cdots ,N\right\},k\ne i;\mathrm{d}\in \left\{1,2,\cdots ,D\right\}$; 11.    Calculate the fitness value of the $v_i$. 12.    $v_{i,d}^{\prime }=ub+lb-v_{i,d}$; 13.    Calculate the fitness value of $v_i^{\prime }$; 14.    if $f\left(v_i\right)>f\left(v_i^{\prime }\right)$ then 15.     $u_i\leftarrow v_i$; $f\left(u_i\right)\leftarrow f\left(v_i\right)$; 16.    else 17.     $u_i\leftarrow v_i^{\prime }$; $f\left(u_i\right)\leftarrow f\left(v_i^{\prime }\right)$; 18.    end 19.    if $f\left(u_i\right)>f\left(x_i\right)$ then 20.     $x_i\leftarrow u_i$; $f\left(x_i\right)\leftarrow f\left(u_i\right)$; $trail\left(i\right)\leftarrow 0$ 21.    else 22.     $trail\left(i\right)\leftarrow trail\left(i\right)+1$; 23.    end 24.   else 25.    $v_i=x_i$; 26.    Find the neighbor $nei$ with the largest degree of $x_i$; 27.    $v_{i,d}=x_{i,d}+rand\left(0,1\right)\left(x_{nei,d}-x_{i,d}\right)$; 28.    Repeat (Steps 10–23) 29.   end 30.  end 31.  Calculate the probability $P\left(i\right)$ of $x_i$; 32.  $i=1$; $t=0$; 33.  while $t<N$ do 34.   if $rand>P\left(i\right)$ then 35.    repeat (Steps 06–30) 36.   end 37.   $i\leftarrow i+1$; 38.   if $i\leftarrow N+1$ then 39.    $i\leftarrow 1$; 40.   end 41.  end 42.  Find the individual $h$ with the maximum trail value; 43.  if $trial\left(h\right)>limit$ then 44.   Randomly generated a new food source to replace the $h$-th food source; 45.  end end

Return the optimal solution $x$ with the largest fitness value.