Research Article
Adaptive Variable Neighborhood Search-Based Supply Network Reconfiguration for Robustness Enhancement
Algorithm 4
Community closeness-based neighborhood determination.
| Input: G=(, E), K and S | | Output: Neighborhood | | = ; | | //Community detection | | {C1,C2,…,Cn} ⟵ Louvin-based community detection () | | //Calculate closeness for each pair of communities | | for each pair (Ce, Cf) do | | Closeness (Ce, Cf) = 0; | | for each node ∈ Cedo | | for each node ∈ Cfdo | | if (, ) ∈ do | | Closeness (Ce, Cf) = Closeness (Ce, Cf) + 1; | | end if | | end for | | end for | | end for | | //Neighborhood determination | | (φ1, φ2) ⟵ find the pair of community with the minimal closeness; | | Neighborhood ⟵ ∅ | | for each ∈ φ1 do | | for each ∈ φ2 do | | if (, ) ∉ do | | Neighborhood ⟵ Neighborhood(,); | | end if | | end for | | end for | | return Neighborhood |
|