Crate non_dominated_sort

Implementation of the Fast Non-Dominated Sort Algorithm as used by NSGA-II. Time complexity is O(K * N^2), where K is the number of objectives and N the number of solutions.

Non-dominated sorting is used in multi-objective (multivariate) optimization to group solutions into non-dominated Pareto fronts according to their objectives. In the existence of multiple objectives, a solution can happen to be better in one objective while at the same time worse in another objective, and as such none of the two solutions dominates the other.

Structs

• Front
• FrontElemIter

Traits

• DominanceOrd
  Trait for comparisons according to dominance order.

Functions

• non_dominated_sort
  Perform a non-dominated sort of solutions. Returns the first Pareto front.