Content deleted Content added
BooBoo314159 (talk | contribs) Dummy edit 1 Tags: Reverted Mobile edit Mobile web edit Advanced mobile edit |
BooBoo314159 (talk | contribs) Dummy edit 2 Tags: Manual revert Mobile edit Mobile web edit Advanced mobile edit |
||
Line 12:
{{Underlinked|date=November 2023}}
Non-dominated sorting (also known as non-dominated ranking) is a technique that involves categorizing a set of elements based on their dominance relationship with each other. The purpose of non-dominated sorting is to rank the elements from the best to the worst element according to their dominance relationship. The dominance relationship between elements is determined by comparing their scores on a fixed number of objective functions.<ref name="NSGA" />
In this context, an element dominates another element if it is better than the other element in at least one objective and no worse in any other objectives<ref name="NSGA" />. For example, if we have two elements A and B, and A has a better value than B in at least one objective, and no worse value in any other objectives, then A dominates B. On the other hand, if B has a better value than A in at least one objective, and no worse value in any other objectives, then B dominates A. If neither A dominates B nor B dominates A, then A and B are said to be non-dominated or incomparable with respect to each other.
| |||