| Modifier and Type | Class and Description |
|---|---|
class |
AbstractEvolutionaryAlgorithm<S extends Solution<?>,R>
Created by Antonio J.
|
class |
AbstractEvolutionStrategy<S extends Solution<?>,Result>
Created by ajnebro on 26/10/14.
|
class |
AbstractGeneticAlgorithm<S extends Solution<?>,Result>
Created by ajnebro on 26/10/14.
|
class |
AbstractParticleSwarmOptimization<S extends Solution<?>,Result>
Created by ajnebro on 26/10/14.
|
class |
AbstractScatterSearch<S extends Solution<?>,R>
Created by Antonio J.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
CrossoverOperator<S extends Solution<?>>
Interface representing crossover operators.
|
interface |
LocalSearchOperator<Source extends Solution<?>>
Interface representing a local search operator
Created by cbarba on 5/3/15.
|
interface |
MutationOperator<Source extends Solution<?>>
Interface representing mutation operators
|
| 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 | 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 | Method and Description |
|---|---|
Solution<?> |
NullMutation.execute(Solution<?> source)
Execute() method
|
| Modifier and Type | Method and Description |
|---|---|
Solution<?> |
NullMutation.execute(Solution<?> source)
Execute() method
|
| 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 |
NaryRandomSelection<S extends Solution<?>>
This class implements a random selection operator used for selecting a N number of solutions from
a 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 |
RandomSelection<S extends Solution<?>>
This class implements a random selection operator used for selecting a N number of solutions from
a list
|
class |
RankingAndCrowdingSelection<S extends Solution<?>>
This class implements a selection for selecting a number of solutions from
a solution list.
|
class |
TournamentSelection<S extends Solution<?>> |
| Modifier and Type | Interface and Description |
|---|---|
interface |
ConstrainedProblem<S extends Solution<?>>
Interface representing problems having constraints
|
interface |
DoubleBinaryProblem<S extends Solution<Object>>
Interface representing problems having integer and double variables
|
interface |
IntegerDoubleProblem<S extends Solution<Number>>
Interface representing problems having integer and double variables
|
interface |
Problem<S extends Solution<?>>
Interface representing a multi-objective optimization problem
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractGenericProblem<S extends Solution<?>> |
class |
AbstractIntegerDoubleProblem<S extends Solution<Number>> |
| Modifier and Type | Class and Description |
|---|---|
class |
Epsilon<Evaluate extends List<? 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<Evaluate extends List<? extends Solution<?>>>
This class implements the generalized spread metric for two or more dimensions.
|
class |
GenerationalDistance<Evaluate extends List<? extends Solution<?>>>
This class implements the generational distance indicator.
|
class |
Hypervolume<Evaluate extends List<? extends Solution<?>>>
This class implements the hypervolume indicator.
|
class |
InvertedGenerationalDistance<Evaluate extends List<? extends Solution<?>>>
This class implements the inverted generational distance metric.
|
class |
InvertedGenerationalDistancePlus<Evaluate extends List<? 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<Evaluate extends List<? 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 | Method and Description |
|---|---|
<S extends Solution<?>> |
FastHypervolume.computeHVContributions(List<S> solutionList)
Computes the HV contribution of the solutions
|
<S extends Solution<?>> |
FastHypervolume.computeSolutionHVContribution(List<S> solutionList,
int solutionIndex,
double solutionSetHV)
Computes the HV contribution of a solutiontype in a solutiontype set.
|
| Modifier and Type | Method and Description |
|---|---|
double |
FastHypervolume.computeHypervolume(List<? extends Solution<?>> solutionList) |
double |
FastHypervolume.computeHypervolume(List<? extends Solution<?>> solutionList,
Point referencePoint) |
double |
FastHypervolume.get2DHV(List<? extends Solution<?>> solutionSet)
Computes the HV of a solution list.
|
int |
WfgHypervolume.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 |
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 | 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<?>> |
SolutionListUtils.distanceMatrix(List<S> solutionSet)
Returns a matrix with the euclidean distance between each pair of solutions in the population.
|
static <S extends Solution<?>> |
SolutionListUtils.findBestSolution(List<S> solutionList,
Comparator<S> comparator) |
static <S extends Solution<?>> |
SolutionListUtils.findIndexOfBestSolution(List<S> solutionList,
Comparator<S> comparator)
Finds the index of the best solution in the list according to a comparator
|
<S extends Solution<?>> |
SolutionListUtils.findWorstSolution(List<S> solutionList,
Comparator<S> comparator) |
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<?>> |
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.isSolutionDominatedBySolutionList(S solution,
List<? extends S> solutionSet) |
static <S extends Solution<?>> |
ProblemUtils.loadProblem(String problemName)
Create an instance of problem passed as argument
|
static <S extends Solution<?>> |
SolutionListUtils.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<?>> |
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 int |
SolutionListUtils.findIndexOfWorstSolution(List<? extends Solution<?>> solutionList,
Comparator<Solution<?>> comparator)
Finds the index of the worst solution in the list according to a comparator
|
static int |
SolutionListUtils.findIndexOfWorstSolution(List<? extends Solution<?>> solutionList,
Comparator<Solution<?>> comparator)
Finds the index of the worst solution in the list according to a comparator
|
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 | Interface and Description |
|---|---|
interface |
Archive<S extends Solution<?>>
Interface representing an archive of solutions
|
interface |
BoundedArchive<S extends Solution<?>>
Interface representing a bounded archive of solutions
|
| 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 |
NonDominatedSolutionListArchive<S extends Solution<?>>
This class implements an archive containing non-dominated solutions
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
ConstraintViolationComparator<S extends Solution<?>> |
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 and
an optional epsilon value (i.e, implements an epsilon dominance comparator)
|
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 |
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 | Method and Description |
|---|---|
int |
HypervolumeContributorComparator.compare(Solution<?> solution1,
Solution<?> solution2)
Compare two solutions.
|
int |
HypervolumeContributorComparator.compare(Solution<?> solution1,
Solution<?> solution2)
Compare two solutions.
|
| 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 | Interface and Description |
|---|---|
interface |
SolutionListEvaluator<S extends Solution<?>>
Created by Antonio J.
|
| Modifier and Type | Class and Description |
|---|---|
class |
MultithreadedSolutionListEvaluator<S extends Solution<?>> |
class |
SequentialSolutionListEvaluator<S extends Solution<?>> |
| 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 |
|---|---|
static void |
SolutionSetOutput.printObjectivesToFile(FileOutputContext context,
List<? extends Solution<?>> solutionSet) |
static void |
SolutionSetOutput.printObjectivesToFile(List<? extends Solution<?>> solutionSet,
String fileName) |
static void |
SolutionSetOutput.printVariablesToFile(FileOutputContext context,
List<? extends Solution<?>> solutionSet) |
static void |
SolutionSetOutput.printVariablesToFile(List<? extends Solution<?>> solutionSet,
String fileName) |
| Constructor and Description |
|---|
Printer(List<? extends Solution<?>> solutionSet) |
| 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 | Interface and Description |
|---|---|
interface |
Neighborhood<S extends Solution<?>> |
| Modifier and Type | Class and Description |
|---|---|
class |
C9<S extends Solution<?>>
Class representing neighborhoods for a
Solution into a list of solutions |
class |
L5<S extends Solution<?>>
Class defining a L5 neighborhood of a solution belonging to a list of solutions which is
structured as a bi-dimensional square mesh.
|
class |
TwoDimensionalMesh<S extends Solution<?>>
Class defining a L5 neighborhood of a solution belonging to a list of solutions which is
structured as a bi-dimensional square mesh.
|
| Modifier and Type | Class and Description |
|---|---|
class |
MultithreadedEvaluator<S extends Solution<?>>
Class for evaluating solutions in parallel using threads
|
| Modifier and Type | Class and Description |
|---|---|
class |
PointSolution
Solution used to wrap a
Point object. |
| Constructor and Description |
|---|
ArrayPoint(Solution<?> solution)
Constructor from a solution
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
DensityEstimator<S extends Solution<?>>
Interface representing implementations to compute the crowding distance
|
interface |
Ranking<S extends Solution<?>>
Ranks a list of solutions according to the dominance relationship
|
interface |
SolutionAttribute<S extends Solution<?>,V>
Attributes allows to extend the
Solution classes to incorporate data required by
operators or algorithms manipulating them. |
| 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 |
HypervolumeContribution<S extends Solution<?>> |
class |
LocationAttribute<S extends Solution<?>> |
class |
NumberOfViolatedConstraints<S extends Solution<?>> |
class |
OverallConstraintViolation<S extends Solution<?>> |
class |
StrengthRawFitness<S extends Solution<?>> |
Copyright © 2015. All rights reserved.