| 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<?>>
Created by Antonio J.
|
interface |
LocalSearchOperator<Source extends Solution<?>>
Created by cbarba on 5/3/15.
|
interface |
MutationOperator<Source extends Solution<?>>
Created by Antonio J.
|
| 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<?>> |
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<?>> |
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 | Method and Description |
|---|---|
<S extends Solution<?>> |
QualityIndicator.execute(List<S> frontA,
List<S> frontB) |
| Modifier and Type | Method and Description |
|---|---|
<S extends Solution<?>> |
WFGHypervolume.execute(List<S> frontA,
List<S> frontB) |
<S extends Solution<?>> |
PISAHypervolume.execute(List<S> paretoFrontApproximation,
List<S> trueParetoFront) |
| Modifier and Type | Method and Description |
|---|---|
<S extends Solution<?>> |
Spread.execute(List<S> paretoFrontApproximation,
List<S> trueParetoFront) |
<S extends Solution<?>> |
SetCoverage.execute(List<S> solutionListA,
List<S> solutionListB) |
<S extends Solution<?>> |
R2.execute(List<S> paretoFrontApproximation,
List<S> trueParetoFront) |
<S extends Solution<?>> |
InvertedGenerationalDistance.execute(List<S> paretoFrontApproximation,
List<S> trueParetoFront) |
<S extends Solution<?>> |
Hypervolume.execute(List<S> paretoFrontApproximation,
List<S> trueParetoFront) |
<S extends Solution<?>> |
GenerationalDistance.execute(List<S> paretoFrontApproximation,
List<S> trueParetoFront) |
<S extends Solution<?>> |
GeneralizedSpread.execute(List<S> paretoFrontApproximation,
List<S> trueParetoFront) |
<S extends Solution<?>> |
ErrorRatio.execute(List<S> paretoFrontApproximation,
List<S> trueParetoFront) |
<S extends Solution<?>> |
Epsilon.execute(List<S> paretoFrontApproximation,
List<S> trueParetoFront) |
| Modifier and Type | Method and Description |
|---|---|
double |
SetCoverage.setCoverage(List<? extends Solution<?>> set1,
List<? extends Solution<?>> set2)
Calculates the set coverage of set1 over set2
|
double |
SetCoverage.setCoverage(List<? extends Solution<?>> set1,
List<? extends Solution<?>> set2)
Calculates the set coverage of set1 over set2
|
| 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 |
DoubleBinarySolution
Created by ajnebro on 24/11/14.
|
interface |
DoubleSolution |
interface |
IntegerDoubleSolution |
interface |
IntegerSolution |
interface |
PermutationSolution<T> |
| Modifier and Type | Method and Description |
|---|---|
Solution<T> |
Solution.copy() |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractGenericSolution<T,P extends Problem<?>>
Created by Antonio J.
|
class |
DefaultBinarySolution
Defines an implementation of a binary solution
Created by Antonio J.
|
class |
DefaultDoubleBinarySolution
Created by Antonio J.
|
class |
DefaultDoubleSolution
Created by Antonio J.
|
class |
DefaultIntegerDoubleSolution
Created by Antonio J.
|
class |
DefaultIntegerPermutationSolution
Created by Antonio J.
|
class |
DefaultIntegerSolution
Created by Antonio J.
|
| 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<?>>
Created by Antonio J.
|
interface |
BoundedArchive<S extends Solution<?>>
Created by Antonio J.
|
| 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 |
FastHypervolumeArchive<S extends Solution<?>>
This class implements a bounded archive based on the hypervolume quality indicator
|
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<?>> |
class |
DominanceComparator<S extends Solution<?>> |
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<?>> |
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<?>> |
| 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<?>>
Created by Antonio J.
|
class |
SequentialSolutionListEvaluator<S extends Solution<?>>
Created by Antonio J.
|
| Modifier and Type | Class and Description |
|---|---|
class |
ExperimentConfiguration<S extends Solution<?>>
Created by Antonio J.
|
class |
ExperimentConfigurationBuilder<S extends Solution<?>>
Created by Antonio J.
|
| 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 | Interface and Description |
|---|---|
interface |
Neighborhood<S extends Solution<?>>
Created by ajnebro on 20/5/15.
|
| Modifier and Type | Class and Description |
|---|---|
class |
C9<S extends Solution<?>>
Class representing neighborhoods for a
Solution into a
SolutionSet. |
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<?>> |
| 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>
Created by Antonio J.
|
| Modifier and Type | Class and Description |
|---|---|
class |
CrowdingDistance<S extends Solution<?>>
This class implements some utilities for calculating distances
|
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> |
class |
HypervolumeContribution<S extends Solution<?>> |
class |
LocationAttribute<S extends Solution<?>> |
class |
StrengthRawFitness<S extends Solution<?>> |
Copyright © 2015. All rights reserved.