Algorithm 2 VBSO Algorithm on CDS

1:procedure vector ${\vee }_j,\forall ,j=1,2,...,m^{\prime }$ 2:    while $f\left(V_j\right)$ does not change successive l iterations do 3:        Calculate $|CD{S}_{\theta }|=({\sum }_{j=1}^{m^{\prime }}|de{g}_j-\overline{deg}{{|}^{\theta })}^{\frac{1}{\theta }}$ 4:        Calculate expected allocated neighbour values as: $\zeta =\frac{n}{M^2}\pi r^2$ 5:        Calculate the allocation value given as: $|A{l}_{\theta }|=({\sum }_{j=1}^{m^{\prime }}|de{g}_j^{\prime }-\zeta {{|}^{\theta })}^{\frac{1}{\theta }}$ 6:        Calculate $f\left(V_j\right)=\frac{n-\left|D\right|}{{\mathcal{W}}_1|CD{S}_{\theta }|+{\mathcal{W}}_2\left|A{l}_{\theta }\right|}$ 7:        if $f\left(V_j\right)$ does not change in simultaneously l iterations then 8:           goto Step 15 9:        else 10:           Calculate direct and indirect cooperation vectors 11:           Apply mutation 12:           Check boundary condition 13:           Selection of offsprings for next iteration 14:           goto 6 15:           return the current optimal solution 16:        end if 17:    end while 18: end procedure