MEA-CNDP: A Membrane Evolutionary Algorithm for Solving Biobjective Critical Node Detection Problem
Algorithm 7
Division.
Input: P (current membrane population), IP (the membrane inherited pool), EM (the external archive membrane), (the probability of selecting from neighbors), B (neighbor membrane matrix)
Output: IP (the membrane inherited pool)
(1)
for each m in P do
(2)
m1 ← Randomly select a membrane from EM;
(3)
m2 ← Select a membrane from the B(m) with probability or from P with probability 1 − ;
(4)
A1, A2 ← ;
(5)
Add the decision variables that are in m1 but not in m2 to A1;
(6)
Add the decision variables that are in m2 but not in m1 to A2;
(7)
o ← m1;//Generate an empty membrane o and duplicate m1(or m2) to o;
(8)
if rand() < 0.5 then
(9)
[x1, x2] ← Randomly select two decision variables from A1;
(10)
Remove the decision variable with larger Score in [x1, x2] in o;
(11)
else
(12)
[x1, x2] ← Randomly select two decision variables from A2;
(13)
Duplicate the decision variable with smaller Score in [x1, x2] in environment, and add it to o;
(14)
if rand() > 0.5 then
(15)
[x1, x2] ← Randomly select two decision variables from o;
(16)
Release the decision variable with larger Score in [x1, x2] in o in environment;
(17)
else
(18)
[x1, x2] ← Randomly select two decision variables from environment that do not exist in o;
(19)
Duplicate the decision variable with smaller Score in [x1, x2], and add it to o;
