Algorithim 2 Pseudocode of calculating the crowding distance
1.	Input:
2.	$N_{Sol}$
3.	objectiveValues
4.	Output:
5.	CrowdingDistance
6.	Start:
7.	crowdingDistance = zeros ($N_{Sol}$);
8.	crowdingDistance (1) = crowdingDistance ($N_{Sol}$) =$\infty$
9.	for (each $i$ objective of objectiveValues) sortedSolutions = sort ($N_{Sol}$,$i$);
10.	for (solution $j$ from 2 to $N_{Sol}$)
11.	crowdingDistance ($j$) = crowdingDistance($j$) + objectiveValues($i$) − objectiveValues($i$ − 1);
12.	end for
13.	end for
14.	End