Research Article
MEA-CNDP: A Membrane Evolutionary Algorithm for Solving Biobjective Critical Node Detection Problem
| | Input: o (the newly generated membrane), (upper bound vectors), NoF (the mark of main objective function), B (neighbor membrane matrix) | | | Output: o, B (the updated neighbor membrane matrix) | | (1) | ← Calculate the value of membrane o to the (NoF + 1)-th objective function; | | (2) | for l = 1 to N do | | (3) | ; | | (4) | ifthen | | (5) | ; | | (6) | k ← ; | | (7) | Remove the upper bound vector of membrane o; | | (8) | Duplicate the upper bound vector in environment, and add it to membrane o; | | (9) | for each mi in B(o) do | | (10) | ← Calculate the value of membrane mi to the (NoF + 1)-th objective function; | | (11) | ; | | (12) | ifthen | | (13) | ; | | (14) | ; | | (15) | ifthen | | (16) | ; | | (17) | ifthen | | (18) | Remove the decision variables of membrane mi; | | (19) | Duplicate the decision variables of membrane o and add them to membrane mi; | | (20) | return o and B; |
|