An External Archive-Based Constrained State Transition Algorithm for Optimal Power Dispatch

Algorithm 2

Pseudocode of the preference trade-off strategy for dealing with constraint functions.

Input:

 State: the candidate solutions.

 SA: the capacity of external archive.

Output:

 archive: the selected potential solutions.

1: f ← feval (funfcn, State).

2: [feasi_num, infeasi_num, fp] ← calculate(SA, f).

3: if 0 < fp< 1 then.

4:   [feasi_x, infeasi_x, ···] ← divide(f, State, ···).

5:   S1 ← sort_feasi (feasi_x, feasi_num, ···).

6:   S2 ← sort_ infeasi_1(infeasi_x, infeasi_num, ···).

7:   archive ← [S1; S2].

8: else.

9:   if fp == 0 then.

10:    infeasi_num ← SA.

11:    S2 ← sort_infeasi_2(State, infeasi_num, ···).

12:    archive ← S2.

13:   else.

14:    feasi_num ← SA.

15:    S1 ← sort_feasi (State, feasi_num, ···).

16:    archive ← S1.

17:   end if.

18: end if.