| Modifier and Type | Class and Description |
|---|---|
class |
NullCrossover<S extends Solution<?>>
This class defines a null crossover operator: the parent solutions are returned without any
change.
|
| Modifier and Type | Method and Description |
|---|---|
List<Solution<T>> |
TwoPointCrossover.execute(List<Solution<T>> solutions) |
List<Solution<T>> |
NPointCrossover.execute(List<Solution<T>> s) |
| Modifier and Type | Method and Description |
|---|---|
List<Solution<T>> |
TwoPointCrossover.execute(List<Solution<T>> solutions) |
List<Solution<T>> |
NPointCrossover.execute(List<Solution<T>> s) |
| Modifier and Type | Class and Description |
|---|---|
class |
ArchiveMutationLocalSearch<S extends Solution<?>>
This class implements a local search operator based in the use of a
mutation operator.
|
class |
BasicLocalSearch<S extends Solution<?>>
This class implements a basic local search operator based in the use of a
mutation operator.
|
| Modifier and Type | Class and Description |
|---|---|
class |
BinaryTournamentSelection<S extends Solution<?>>
Applies a binary tournament selection to return the best solution between two that have been
chosen at random from a solution list.
|
class |
NaryTournamentSelection<S extends Solution<?>>
Applies a N-ary tournament selection to return the best solution between N that have been
chosen at random from a solution list.
|
class |
RankingAndCrowdingSelection<S extends Solution<?>>
This class implements a selection for selecting a number of solutions from
a solution list.
|
class |
RankingAndPreferenceSelection<S extends Solution<?>> |
class |
TournamentSelection<S extends Solution<?>> |
| Modifier and Type | Class and Description |
|---|---|
class |
Epsilon<S extends Solution<?>>
This class implements the unary epsilon additive indicator as proposed in E.
|
class |
ErrorRatio<Evaluate extends List<? extends Solution<?>>>
The Error Ratio (ER) quality indicator reports the ratio of solutions in a front of points
that are not members of the true Pareto front.
|
class |
GeneralizedSpread<S extends Solution<?>>
This class implements the generalized spread metric for two or more dimensions.
|
class |
GenerationalDistance<S extends Solution<?>>
This class implements the generational distance indicator.
|
class |
InvertedGenerationalDistance<S extends Solution<?>>
This class implements the inverted generational distance metric.
|
class |
InvertedGenerationalDistancePlus<S extends Solution<?>>
This class implements the inverted generational distance metric plust (IGD+)
Reference: Ishibuchi et al 2015, "A Study on Performance Evaluation Ability of a Modified
Inverted Generational Distance Indicator", GECCO 2015
|
class |
R2<Evaluate extends List<? extends Solution<?>>>
TODO: Add comments here
|
class |
Spread<S extends Solution<?>>
This class implements the spread quality indicator.
|
| Modifier and Type | Method and Description |
|---|---|
double |
SetCoverage.evaluate(List<? extends Solution<?>> set1,
List<? extends Solution<?>> set2)
Calculates the set coverage of set1 over set2
|
double |
SetCoverage.evaluate(List<? extends Solution<?>> set1,
List<? extends Solution<?>> set2)
Calculates the set coverage of set1 over set2
|
org.apache.commons.lang3.tuple.Pair<Double,Double> |
SetCoverage.evaluate(org.apache.commons.lang3.tuple.Pair<List<? extends Solution<?>>,List<? extends Solution<?>>> pairOfSolutionLists) |
org.apache.commons.lang3.tuple.Pair<Double,Double> |
SetCoverage.evaluate(org.apache.commons.lang3.tuple.Pair<List<? extends Solution<?>>,List<? extends Solution<?>>> pairOfSolutionLists) |
| Modifier and Type | Class and Description |
|---|---|
class |
PISAHypervolume<S extends Solution<?>>
This class implements the hypervolume indicator.
|
class |
WFGHypervolume<S extends Solution<?>>
Created by ajnebro on 2/2/15.
|
| Modifier and Type | Method and Description |
|---|---|
double |
WFGHypervolume.get2DHV(List<? extends Solution<?>> solutionSet)
Computes the HV of a solution list.
|
| Modifier and Type | Method and Description |
|---|---|
int |
WfgHypervolumeVersion.getLessContributorHV(List<Solution<?>> solutionList) |
| Constructor and Description |
|---|
WfgHypervolumeFront(List<? extends Solution<?>> solutionList) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
BinarySolution
Interface representing a binary (bitset) solutions
|
interface |
DoubleBinarySolution
Interface representing a solution having an array of real values and a bitset
|
interface |
DoubleSolution
Interface representing a double solutions
|
interface |
IntegerDoubleSolution
Interface representing a solution composed of integers and real values
|
interface |
IntegerSolution
Interface representing a integer solutions
|
interface |
PermutationSolution<T>
Interface representing permutation based solutions
|
| Modifier and Type | Method and Description |
|---|---|
Solution<T> |
Solution.copy() |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractGenericSolution<T,P extends Problem<?>>
Abstract class representing a generic solution
|
class |
ArrayDoubleSolution
Implementation of
DoubleSolution using arrays. |
class |
DefaultBinarySolution
Defines an implementation of a binary solution
|
class |
DefaultDoubleBinarySolution
Description:
- this solution contains an array of double value + a binary string
- getNumberOfVariables() returns the number of double values + 1 (the string)
- getNumberOfDoubleVariables() returns the number of double values
- getNumberOfVariables() = getNumberOfDoubleVariables() + 1
- the bitset is the last variable
|
class |
DefaultDoubleSolution
Defines an implementation of a double solution
|
class |
DefaultIntegerDoubleSolution
Defines an implementation of a class for solutions having integers and doubles
|
class |
DefaultIntegerPermutationSolution
Defines an implementation of solution composed of a permuation of integers
|
class |
DefaultIntegerSolution
Defines an implementation of an integer solution
|
| Modifier and Type | Method and Description |
|---|---|
Solution<Double> |
ArrayDoubleSolution.copy() |
| Modifier and Type | Class and Description |
|---|---|
class |
AdaptiveGrid<S extends Solution<?>>
This class defines an adaptive grid over a list of solutions as the one used by algorithm PAES.
|
| Modifier and Type | Method and Description |
|---|---|
static <S extends Solution<?>> |
SolutionUtils.averageDistanceToSolutionList(S solution,
List<S> solutionList)
Returns the average euclidean distance of a solution to the solutions of a list.
|
static <S extends Solution<?>> |
SolutionUtils.distanceBetweenObjectives(S firstSolution,
S secondSolution)
Returns the euclidean distance between a pair of solutions in the objective space
|
static <S extends Solution<?>> |
SolutionListUtils.distanceMatrix(List<S> solutionSet)
Returns a matrix with the euclidean distance between each pair of solutions in the population.
|
static <S extends Solution<?>> |
SolutionUtils.getBestSolution(S solution1,
S solution2,
Comparator<S> comparator)
Return the best solution between those passed as arguments.
|
static <S extends Solution<?>> |
SolutionUtils.getBestSolution(S solution1,
S solution2,
Comparator<S> comparator,
java.util.function.BinaryOperator<S> equalityPolicy)
Return the best solution between those passed as arguments.
|
static <S extends Solution<?>> |
SolutionUtils.getBestSolution(S solution1,
S solution2,
Comparator<S> comparator,
RandomGenerator<Double> randomGenerator)
Return the best solution between those passed as arguments.
|
static <S extends Solution<?>> |
SolutionListUtils.getInvertedFront(List<S> solutionSet)
This method receives a normalized list of non-dominated solutions and return the inverted one.
|
static <S extends Solution<?>> |
SolutionListUtils.getNondominatedSolutions(List<S> solutionList) |
static <S extends Solution<?>> |
SolutionListUtils.getObjectiveArrayFromSolutionList(List<S> solutionList,
int objective)
Given a solution list and the identifier of an objective (0, 1, etc), returns an array with
the values of that objective in all the solutions of the list
|
static <S extends Solution<?>> |
SolutionListUtils.isSolutionDominatedBySolutionList(S solution,
List<? extends S> solutionSet) |
static <S extends Solution<?>> |
AbstractAlgorithmRunner.printQualityIndicators(List<S> population,
String paretoFrontFile)
Print all the available quality indicators
|
static <S extends Solution<?>> |
SolutionListUtils.writeObjectivesToMatrix(List<S> solutionList) |
| Modifier and Type | Method and Description |
|---|---|
static List<Solution<?>> |
SolutionListUtils.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.
|
| Modifier and Type | Method and Description |
|---|---|
static List<Solution<?>> |
SolutionListUtils.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 void |
AbstractAlgorithmRunner.printFinalSolutionSet(List<? extends Solution<?>> population)
Write the population into two files and prints some data on screen
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractBoundedArchive<S extends Solution<?>> |
class |
AdaptiveGridArchive<S extends Solution<?>>
This class implements an archive (solution list) based on an adaptive grid used in PAES
|
class |
CrowdingDistanceArchive<S extends Solution<?>>
Created by Antonio J.
|
class |
HypervolumeArchive<S extends Solution<?>>
Created by Antonio J.
|
class |
NonDominatedSolutionListArchive<S extends Solution<?>>
This class implements an archive containing non-dominated solutions
|
| Modifier and Type | Class and Description |
|---|---|
class |
DecisionTreeEstimator<S extends Solution<?>> |
| Modifier and Type | Class and Description |
|---|---|
class |
ArtificialDecisionMakerDecisionTree<S extends Solution<?>>
Class implementing the
Towards automatic testing of reference point based interactive methods described in:
Ojalehto, V., Podkopaev, D., & Miettinen, K. (2016, September).
|
class |
ArtificiallDecisionMakerBuilder<S extends Solution<?>> |
| Modifier and Type | Class and Description |
|---|---|
class |
CrowdingDistanceComparator<S extends Solution<?>>
Compares two solutions according to the crowding distance attribute.
|
class |
DominanceComparator<S extends Solution<?>>
This class implements a solution comparator taking into account the violation constraints
|
class |
EqualSolutionsComparator<S extends Solution<?>>
This class implements a
Comparator (a method for comparing
Solution objects) based whether all the objective values are
equal or not. |
class |
FitnessComparator<S extends Solution<?>>
This class implements a
Comparator (a method for comparing
Solution objects) based on the fitness value returned by the
method getFitness. |
class |
GDominanceComparator<S extends Solution<?>>
This class implements a solution comparator according to the concept of g-dominance
(https://doi.org/10.1016/j.ejor.2008.07.015)
|
class |
HypervolumeContributionComparator<S extends Solution<?>>
Compares two solutions according to the crowding distance attribute.
|
class |
ObjectiveComparator<S extends Solution<?>>
This class implements a comparator based on a given objective
|
class |
RankingAndCrowdingDistanceComparator<S extends Solution<?>> |
class |
RankingComparator<S extends Solution<?>> |
class |
StrengthFitnessComparator<S extends Solution<?>> |
| Modifier and Type | Class and Description |
|---|---|
class |
OverallConstraintViolationComparator<S extends Solution<?>>
This class implements a
Comparator (a method for comparing Solution objects)
based on the overall constraint violation of the solutions, as done in NSGA-II. |
class |
ViolationThresholdComparator<S extends Solution<?>>
This class implements the ViolationThreshold Comparator *
|
| Modifier and Type | Class and Description |
|---|---|
class |
CosineDistanceBetweenSolutionsInObjectiveSpace<S extends Solution<?>>
Class for calculating the cosine distance between two
Solution objects in objective space. |
class |
EuclideanDistanceBetweenSolutionAndASolutionListInObjectiveSpace<S extends Solution<Double>,L extends List<S>>
|
class |
EuclideanDistanceBetweenSolutionsInObjectiveSpace<S extends Solution<?>>
Class for calculating the Euclidean distance between two
Solution objects in objective space. |
class |
EuclideanDistanceBetweenSolutionsInSolutionSpace<S extends Solution<Double>>
Class for calculating the Euclidean distance between two
DoubleSolution objects in solution space. |
| Modifier and Type | Class and Description |
|---|---|
class |
Experiment<S extends Solution<?>,Result>
Class for describing the configuration of a jMetal experiment.
|
class |
ExperimentBuilder<S extends Solution<?>,Result>
Builder for class
Experiment |
| Modifier and Type | Class and Description |
|---|---|
class |
ComputeQualityIndicators<S extends Solution<?>,Result>
This class computes the
QualityIndicators of an experiment. |
class |
ExecuteAlgorithms<S extends Solution<?>,Result>
This class executes the algorithms the have been configured with a instance of class
Experiment. |
| Modifier and Type | Class and Description |
|---|---|
class |
ExperimentAlgorithm<S extends Solution<?>,Result>
Class defining tasks for the execution of algorithms in parallel.
|
class |
ExperimentProblem<S extends Solution<?>>
Class used to add a tag field to a problem.
|
| Modifier and Type | Method and Description |
|---|---|
List<Double> |
SolutionListExtremeValues.findHighestValues(List<Solution<?>> solutionList) |
List<Double> |
SolutionListExtremeValues.findLowestValues(List<Solution<?>> solutionList) |
| Modifier and Type | Method and Description |
|---|---|
void |
SolutionListOutput.printObjectivesToFile(FileOutputContext context,
List<? extends Solution<?>> solutionList) |
void |
SolutionListOutput.printObjectivesToFile(FileOutputContext context,
List<? extends Solution<?>> solutionList,
List<Boolean> minimizeObjective) |
void |
SolutionListOutput.printVariablesToFile(FileOutputContext context,
List<? extends Solution<?>> solutionList) |
| Constructor and Description |
|---|
SolutionListOutput(List<? extends Solution<?>> solutionList) |
| Constructor and Description |
|---|
ArrayFront(List<? extends Solution<?>> solutionList)
Constructor
|
| Modifier and Type | Method and Description |
|---|---|
List<? extends Solution<?>> |
FrontNormalizer.normalize(List<? extends Solution<?>> solutionList)
Returns a normalized front
|
| Modifier and Type | Method and Description |
|---|---|
List<? extends Solution<?>> |
FrontNormalizer.normalize(List<? extends Solution<?>> solutionList)
Returns a normalized front
|
| Constructor and Description |
|---|
FrontNormalizer(List<? extends Solution<?>> referenceFront)
Constructor.
|
| Modifier and Type | Class and Description |
|---|---|
class |
C25<S extends Solution<?>>
Class defining an C25 neighborhood of a solution belonging to a list of solutions which is
structured as a bi-dimensional mesh.
|
class |
C49<S extends Solution<?>>
Class defining an C49 neighborhood of a solution belonging to a list of solutions which is
structured as a bi-dimensional mesh.
|
class |
KNearestNeighborhood<S extends Solution<?>>
This class implements a neighborhood that select the k-nearest solutions according to a distance measure.
|
class |
L13<S extends Solution<?>>
Class defining an L9 neighborhood of a solution belonging to a list of solutions which is
structured as a bi-dimensional mesh.
|
class |
L25<S extends Solution<?>>
Class representing neighborhoods for a solution into a list of solutions
|
class |
L41<S extends Solution<?>>
Class representing neighborhoods for a solution into a list of solutions
|
| Constructor and Description |
|---|
ArrayPoint(Solution<?> solution)
Constructor from a solution
|
| Modifier and Type | Class and Description |
|---|---|
class |
PointSolution
Solution used to wrap a
Point object. |
| Constructor and Description |
|---|
PointSolution(Solution<?> solution)
Constructor
|
| Modifier and Type | Class and Description |
|---|---|
class |
ReferencePoint
Interface representing a reference point
|
| Modifier and Type | Method and Description |
|---|---|
abstract void |
ReferencePoint.update(Solution<?> solution) |
| Modifier and Type | Class and Description |
|---|---|
class |
IdealPoint
Class representing an ideal point (minimization is assumed)
|
class |
NadirPoint
Class representing a nadir point (minimization is assumed)
|
| Modifier and Type | Method and Description |
|---|---|
void |
IdealPoint.update(Solution<?> solution) |
void |
NadirPoint.update(Solution<?> solution) |
| Modifier and Type | Class and Description |
|---|---|
class |
CrowdingDistance<S extends Solution<?>>
This class implements the crowding distance
|
class |
DominanceRanking<S extends Solution<?>>
This class implements some facilities for ranking set of solutions.
|
class |
Fitness<S extends Solution<?>> |
class |
GenericSolutionAttribute<S extends Solution<?>,V>
Generic class for implementing
SolutionAttribute classes. |
class |
HypervolumeContributionAttribute<S extends Solution<?>> |
class |
LocationAttribute<S extends Solution<?>> |
class |
NumberOfViolatedConstraints<S extends Solution<?>> |
class |
OverallConstraintViolation<S extends Solution<?>> |
class |
PreferenceDistance<S extends Solution<?>> |
class |
StrengthRawFitness<S extends Solution<?>> |
Copyright © 2018. All rights reserved.