public class SolutionListUtils extends Object
| Constructor and Description |
|---|
SolutionListUtils() |
| Modifier and Type | Method and Description |
|---|---|
static <S extends Solution<?>> |
distanceMatrix(List<S> solutionSet)
Returns a matrix with the euclidean distance between each pair of solutions in the population.
|
static <S extends Solution<?>> |
findBestSolution(List<S> solutionList,
Comparator<S> comparator) |
static <S extends Solution<?>> |
findIndexOfBestSolution(List<S> solutionList,
Comparator<S> comparator)
Finds the index of the best solution in the list according to a comparator
|
static int |
findIndexOfWorstSolution(List<? extends Solution<?>> solutionList,
Comparator<Solution<?>> comparator)
Finds the index of the worst solution in the list according to a comparator
|
<S extends Solution<?>> |
findWorstSolution(List<S> solutionList,
Comparator<S> comparator) |
static <S extends Solution<?>> |
getInvertedFront(List<S> solutionSet)
This method receives a normalized list of non-dominated solutions and return the inverted one.
|
static <S extends Solution<?>> |
getNondominatedSolutions(List<S> solutionList) |
static List<Solution<?>> |
getNormalizedFront(List<Solution<?>> solutionList,
List<Double> maximumValue,
List<Double> minimumValue)
This method receives a list of non-dominated solutions and maximum and minimum values of the
objectives, and returns a the normalized set of solutions.
|
static <S extends Solution<?>> |
isSolutionDominatedBySolutionList(S solution,
List<? extends S> solutionSet) |
static <S extends Solution<?>> |
selectNRandomDifferentSolutions(int numberOfSolutionsToBeReturned,
List<S> solutionList)
This method receives a normalized list of non-dominated solutions and return the inverted one.
|
static <S extends Solution<?>> |
writeObjectivesToMatrix(List<S> solutionList) |
public static <S extends Solution<?>> List<S> getNondominatedSolutions(List<S> solutionList)
public <S extends Solution<?>> int findWorstSolution(List<S> solutionList, Comparator<S> comparator)
public static <S extends Solution<?>> int findIndexOfBestSolution(List<S> solutionList, Comparator<S> comparator)
solutionList - comparator - public static int findIndexOfWorstSolution(List<? extends Solution<?>> solutionList, Comparator<Solution<?>> comparator)
solutionList - comparator - public static <S extends Solution<?>> S findBestSolution(List<S> solutionList, Comparator<S> comparator)
public static <S extends Solution<?>> double[][] writeObjectivesToMatrix(List<S> solutionList)
public static List<Solution<?>> getNormalizedFront(List<Solution<?>> solutionList, List<Double> maximumValue, List<Double> minimumValue)
solutionList - A list of non-dominated solutionsmaximumValue - The maximum values of the objectivesminimumValue - The minimum values of the objectivespublic static <S extends Solution<?>> List<S> getInvertedFront(List<S> solutionSet)
solutionSet - The front to invertpublic static <S extends Solution<?>> boolean isSolutionDominatedBySolutionList(S solution, List<? extends S> solutionSet)
public static <S extends Solution<?>> List<S> selectNRandomDifferentSolutions(int numberOfSolutionsToBeReturned, List<S> solutionList)
solutionList - The front to invertCopyright © 2015. All rights reserved.