Research Article
MEA-CNDP: A Membrane Evolutionary Algorithm for Solving Biobjective Critical Node Detection Problem
Algorithm 3
Score_Assignment. Calculate the scores of decision variables.
| | Input: D (the number of decision variables), Cost (weights related to deleting nodes) | | | Output: Score (the scores of decision variables) | | (1) | Degree ← Calculate the degree of the node corresponding to each decision variable in the original graph; | | (2) | S ← ; | | (3) | for each xiin the set of decision variables do | | (4) | if > 1 then | | (5) | S ← S xi; | | (6) | Q ← S |D| matrix with all elements value 0; | | (7) | j ← 0; | | (8) | for each x in S do | | (9) | Flip the decision variable x in the j-th row of Q to 1; | | (10) | j++; | | (11) | Do nondominated sorting on Q; | | (12) | Score ← D 1 matrix with all elements value Max_Double; | | (13) | for i = 1 to D do | | (14) | if > 1 then | | (15) | Scorei = Fi/Costi;//Fi is the nondominated front number of the i-th row of Q; | | (16) | return Score; |
|