Algorithm 1 RC_PNB Search Algorithm

$x$ = $x_0$

$PN{B}_{s_j}=PBN\_find\_fun\left(x,M,s{n}_{tl\_min}\right)$;

$A=length\left(PN{B}_{s_j}\right)$;

$B=randi\left(A\right)$;

If rand > 0.5

$A_1$=$A\left(1:B,:\right)$;

else

$A_1$=$A\left(B:end,:\right)$;

end

$x\left(A_1\right)=s{n}_{tl\_min}$

Connectivity constraint check and assurance algorithm, $x$ → $x_1$

Compactness constraint assurance, $x_1$ → $x_2$

If $F\left(x_2\right)$ < $F\left(x_0\right)$

$x_0$ = $x_2$

else

$x_0$ = $x_0$

end