Algorithm 1: Main Procedure of the Proposed NTSEA

Input: population size N, maximum function evaluations ( T max )

Output: the final population P

1: P ← I n i t i a l i z e ( P )

2:Generate N uniformly distributed m dimensional unit vectors as Z ← { z 1 , z 2 , ⋯ , z N }

3: z ← Z min

4: while t < T max do

5: Grid setting for P

6: Fitness assignment for P

7: M P ← M a t i n g s e l e c t i o n ( P )

8: P ′ ← G e n e r a t e O f f s p r i n g s ( M P )

9: Q ← P ∪ P ′

10: P ← E n v i r o n m e n t a l s e l e c t i o n ( Q )

11: end while