Research Article
MEA-CNDP: A Membrane Evolutionary Algorithm for Solving Biobjective Critical Node Detection Problem
Algorithm 6
Membrane-to-subproblem matching.
| | Input: P (current membrane population), NoF (the mark of main objective function) | | | Output: P (membrane population) | | (1) | S ← ; | | (2) | for each m in P do | | (3) | Remove the upper bound vector of m and add it to S; | | (4) | while S is not empty do | | (5) | ← Randomly select a upper bound vector from S; | | (6) | for each miin P do | | (7) | ← Calculate the value of membrane mi to the (NoF + 1)-th objective function; | | (8) | ← ; | | (9) | k ← ; | | (10) | Remove the upper bound vector of membrane mk; | | (11) | Add the upper bound vector to membrane mk; | | (12) | Delete the upper bound vector of S; | | (13) | return P; |
|