Algorithim 4 Pseudocode of selecting the elites
1.	Input:
2.	Pool of Solutions
3.	Rank
4.	AngleRangeRank
5	$CrowdingDistance$
6.	$N$                    //number of the selected solutions
7.	Output:
8.	selected solutions
9.	Start:
10.	for (solution = 1 to $N$)            //number of the selected solutions
11.	Select two individuals A, B randomly for an individual
12.	Compute Non-domination rank (rank)
13.	Compute Crowding distance (distance)
14.	Compute Angle rank level (angle Range Rank)
15.
16.	//Compare Solutions
17.	betterRank = A_rank < B_rank
18.	sameRank = A_rank == B_rank
19.	betterAngleRangeRank = A_angleRangeRank > B_angleRangeRank
20.	sameAngleRangeRank = A_angleRangeRank == B_angleRangeRank
21.	betterCrowdingDiandstance = A_distance > B_distance
22.	if (betterRank)
23.	or (sameRank and betterAngleRangeRank)
24.	or (sameRank and sameAngleRangeRank and betterCrowdingDistance)
25.	then
26.	add A to the selected solutions
27.	else
28.	add B to the selected solutions
29.	end if
30.	end for
31.	End