Table 2 Algorithm 1

1: Initialization: Cbn₀ = (AP_1,0,...AP_k,0,...AP_N,0), where AP_k,0(k = 1~N) is randomly set and $f_{Cb{n}_0}$ is computed according to formula (), the iteration number t = 0, T = T₀;

2: Cbn* = Cbn₀,$f^{*}=f_{Cb{n}_0}$;

3: One FBS k is randomly chosen to change its antenna pattern to an arbitrary different one, and antennas configuration combination changed from Cbn _t = (AP_1,t,...AP _{k, t} ,...AP _{N, t} ) to $Cb{n_t}^{\prime }=\left(A{P}_{1,t},...A{P_{k,t}}^{\prime },...A{P}_{N,t}\right)$;

4: if $f_{Cb{n}_t}\le f_{Cb{n_t}^{\prime }}$then

5: the new antenna patterns combination $Cb{n_t}^{\prime }$ is accepted;

6: else

7: $Cb{n_t}^{\prime }$ is accepted with probability$exp\left(-\frac{f_{Cb{n}_t}-f_{Cb{n_t}^{\prime }}}{T}\right)$.

8: end if;

9: if $f_{Cb{n}_t}>f^{*}$then $f^{*}=f_{Cb{n}_t}$ and Cbn* = Cbn_t;

11: end if;

12: t = t+1;

13: if t > max_num or f * hasn't changed in 10 iterations then

14: Break;

15: else T = αT(0 <α < 1 and α is related with max_num) and return to step 3;

16: end