Algorithm 5: Operation when edge switching adjustment is accepted

//avg Gk’ > avg Gk: adjustment accepted;

1: if(avg Gk > avg Li) then//avg Gi’ > avg Gi > avg Li;

2:   Attempt to back-up G k in L k;

3:   sort_list(k);

4:   avg Gk← avg Gk’;

5:   num Gk←1;

6:   sum Gk← avg Gk’;

7:   Flag List←false;

8:   G k←G k‘;

9: elseif(avg Li > avg Gk’) then //avg Li > avg Gi’ > avg Gi

10:    restoration(k);

11:    is_list_taken←true;

12: else

13:  avg Gk← avg Gk’;

14:  num Gk←1;

15:  sum Gk← avg Gk’;

16:  Flag List←false;

17:  G k←G k‘;

18: end if;