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

Algorithm 1

Pseudocode of external archive-based STA for constrained optimization problems.

Input:

 maxiter: the maximum number of iterations.

 SE: the number of samples.

 SA: the capacity of the external archive.

 archive: the initial solutions.

Output:

 Best^∗: the optimal solution.

1: for iter = 1 to maxiter do.

2:   if α < α_min then.

3:    α ← α_max.

4:   end if.

5:   if δ < δ_min then.

6:    δ ← δ_max.

7:   end if.

8:   archive ← expansion (archive, γ, SA, SE, ···).

9:   archive ← rotation (archive, α, SA, SE, ···).

10:     archive ← axesion (archive, δ, SA, SE, ···).

11:     archive ← translation (archive, β, SA, SE, ···).

12:     α ← α/fc.

13:     δ ← δ/fc.

14: end for.

15: F_archive ← feval (funfcn, archive).

16: Best^∗ ← sort(archive, F_archive).