Algorithm 1 Pseudocode of the HAES Algorithm
1.	Input:
2.	$N_{Gen}$                  //Number of Generations
3.	$N_{Sol}$                 //Number of Solutions
4.	SectorRange               //Sector Range
5.	$SoB$ = fi, where i = 1, 2, …, m;      //Set of Objectives
6.	K                    //size of objectives partitioning
7.	Output:
8.	ParetoFront            //Found Pareto Front
9.	Start:
10.	$P_0$ = InitiateFirstPopulation$N_{Sol}$;      //generate first population randomly
11.	populationPrevious = $P_0$;      //first population is the previous population
12.	counterOfGeneration = $1$;
13.	angleRangeRank = zeros (1, 2π/SectorRange) //initialize the angle range rank
14.	while (CounterofGeneration < $N_{Gen}$)
15.	$SSoB$ = $selectSubSet\left(SoB,k\right)$
16.	[solutionsRanks,objectiveValues] = evaluate (populationPrevious,$SSoB$)
17.	[crowdingDistance] = updateCrowdingDistance (populationPrevious,objectiveValues)
18.	[angleRangeRank] = updateRanges (populationPrevious,solutionsRanks,
19.	SectorRange,angleRangeRank, $SoB$) //select $N_{Sol}$ from the previous solutions
20.	selected Elites = selectElites
21.	($P_0$,solutionsRanks,angleRangeRank,crowdingDistance, $N_{Sol}$)
22.	offSpring = geneticOperations (selected Elites)
23.	combinedPop = selectedElites || offSpring sortedCombinedPop =
24.	NonNominatedSorting (combinedPop)
25.	$P_{New}$ = selectElites (sortedCombinedPop, angleRangeRank,NSol)
26.	populationPrevious = $P_{New};$
27.	CounterofGeneration++;
28.	end while
29.	End