A Knee Point-Driven Many-Objective Evolutionary Algorithm with Adaptive Switching Mechanism

Algorithm 7

Selection (, , and ).

Input:F (sorted population), K (set of knee points), N (population size);

Output: P (next population)

1 P = ∅, i = 1

2 P ← P ∪ (K ∩ F_l) / Select the knee point and the solutions in F₁…F_l into P/

3 P ← F₁ ∪… ∪ F_l-1

4 Ifthen

5   Delete solutions from K ∩ F_l, which have the minimum distances to the hyperplane

6 Else Ifthen

7   Associate each member of F_l with a solution in P: Association (P, F_l)

8   Choose solutions one by one from F_l to construct final P: P = Niching (P, F_l, )

10 End If

11 ReturnP