Research Article
MEA-CNDP: A Membrane Evolutionary Algorithm for Solving Biobjective Critical Node Detection Problem
Algorithm 2
Framework of MEA-CNDP. The MEA solving bi-CNDP.
| | Input: the critical node detection problem, related parameters | | | Output: the external archive membrane | | (1) | Generate the initial membrane structure; | | (2) | ← generate N upper bound vectors of uniform distribution | | (3) | Score ← calculate the scores of decision variables;//Algorithm 3 | | (4) | P ← generate the initial membrane population;//Algorithm 4 | | (5) | B ← calculate the neighbor membrane | | (6) | Pi ← array of size N with all elements value 1; | | (7) | Initialize the external archive membrane EM; | | (8) | Initialize Z∗, Znad; | | (9) | NoF ← 0; | | (10) | CurGen ← 0; | | (11) | while CurGen < MaxGendo | | (12) | if CurGen % DRAinterval = = 0 then | | (13) | UpdateIP;//Algorithm 5; | | (14) | if CurGen % INm = = 0 then | | (15) | NoF = 1 – NoF;//Transfrom the main objective | | (16) | Membrane-to-Subproblem Matching;//Algorithm 6 | | (17) | Evolve IP: | | (18) | Division operator;//Algorithm 7 | | (19) | Update Z∗; | | (20) | Fusion operator;//Algorithm 8 | | (21) | CytolysisiAndSelection operator;//Algorithm 9 | | (22) | Update Znad; | | (23) | CurGen ← CurGen + 1; | | (24) | return EM; |
|
