Interface DominanceComparator

All Known Subinterfaces:
AggregateObjectiveComparator
All Known Implementing Classes:
AbstractAggregateObjectiveComparator, AggregateConstraintComparator, ChainedComparator, CrowdingComparator, EpsilonBoxDominanceComparator, EpsilonBoxObjectiveComparator, FitnessComparator, LinearDominanceComparator, LinearObjectiveComparator, MinMaxDominanceComparator, MinMaxObjectiveComparator, NondominatedSortingComparator, ObjectiveComparator, ParetoConstraintComparator, ParetoDominanceComparator, ParetoObjectiveComparator, RankComparator, VectorAngleDistanceScalingComparator

public interface DominanceComparator
Interface for comparing two solutions using a dominance relation. A dominance relation may impose a partial or total ordering on a set of solutions.

Implementations which also implement Comparator impose a total ordering on the set of solutions. However, it is typically the case that (compare(x, y)==0) == (x.equals(y)) does not hold, and the comparator may impose orderings that are inconsistent with equals.

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    compare(Solution solution1, Solution solution2)
    Compares the two solutions using a dominance relation, returning -1 if solution1 dominates solution2, 1 if solution2 dominates solution1, and 0 if the solutions are non-dominated.
  • Method Details

    • compare

      int compare(Solution solution1, Solution solution2)
      Compares the two solutions using a dominance relation, returning -1 if solution1 dominates solution2, 1 if solution2 dominates solution1, and 0 if the solutions are non-dominated.
      Parameters:
      solution1 - the first solution
      solution2 - the second solution
      Returns:
      -1 if solution1 dominates solution2, 1 if solution2 dominates solution1, and 0 if the solutions are non-dominated