| 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.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
CrossoverOperator<Source extends List<? extends Solution>,Result extends List<? extends Solution>>
Created by Antonio J.
|
interface |
CrossoverOperator<Source extends List<? extends Solution>,Result extends List<? 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<Source extends List<? extends Solution>,Result extends List<? extends Solution>>
This class defines a null crossover operator: the parent solutions are returned without any
change.
|
class |
NullCrossover<Source extends List<? extends Solution>,Result extends List<? extends Solution>>
This class defines a null crossover operator: the parent solutions are returned without any
change.
|
| Modifier and Type | Method and Description |
|---|---|
Solution |
MutationLocalSearch.execute(Solution solution)
Executes the local search.
|
| Modifier and Type | Method and Description |
|---|---|
Solution |
MutationLocalSearch.execute(Solution solution)
Executes the local search.
|
| 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 | Method and Description |
|---|---|
Solution |
TournamentSelection.execute(List<Solution> solutionList) |
Solution |
NaryTournamentSelection.execute(List<Solution> solutionList) |
| Modifier and Type | Method and Description |
|---|---|
protected List<Solution> |
RankingAndCrowdingSelection.crowdingDistanceSelection(Ranking ranking) |
List<? extends Solution> |
RankingAndCrowdingSelection.execute(List<? extends Solution> solutionList)
Execute() method
|
List<? extends Solution> |
RandomSelection.execute(List<? extends Solution> solutionList)
Execute() method
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
RankingAndCrowdingSelection.addLastRankedSolutionsToPopulation(Ranking ranking,
int rank,
List<Solution> population) |
protected void |
RankingAndCrowdingSelection.addRankedSolutionsToPopulation(Ranking ranking,
int rank,
List<Solution> population) |
List<? extends Solution> |
RankingAndCrowdingSelection.execute(List<? extends Solution> solutionList)
Execute() method
|
List<? extends Solution> |
RandomSelection.execute(List<? extends Solution> solutionList)
Execute() method
|
Solution |
TournamentSelection.execute(List<Solution> solutionList) |
Solution |
NaryTournamentSelection.execute(List<Solution> solutionList) |
protected boolean |
RankingAndCrowdingSelection.subfrontFillsIntoThePopulation(Ranking ranking,
int rank,
List<Solution> population) |
| Constructor and Description |
|---|
BinaryTournamentSelection(Comparator<Solution> comparator)
Constructor
|
NaryTournamentSelection(int numberOfSolutionsToBeReturned,
Comparator<Solution> comparator)
Constructor
|
TournamentSelection(Comparator<Solution> comparator,
int numberOfTournaments)
Constructor
|
| 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 |
|---|---|
double |
QualityIndicator.execute(List<? extends Solution> frontA,
List<? extends Solution> frontB) |
double |
QualityIndicator.execute(List<? extends Solution> frontA,
List<? extends Solution> frontB) |
| Modifier and Type | Method and Description |
|---|---|
double |
Spread.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
Spread.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
SetCoverage.execute(List<? extends Solution> solutionListA,
List<? extends Solution> solutionListB) |
double |
SetCoverage.execute(List<? extends Solution> solutionListA,
List<? extends Solution> solutionListB) |
double |
R2.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
R2.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
InvertedGenerationalDistance.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
InvertedGenerationalDistance.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
Hypervolume.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
Hypervolume.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
GenerationalDistance.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
GenerationalDistance.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
GeneralizedSpread.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
GeneralizedSpread.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
ErrorRatio.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
ErrorRatio.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
Epsilon.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
double |
Epsilon.execute(List<? extends Solution> paretoFrontApproximation,
List<? extends Solution> trueParetoFront) |
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 |
|---|---|
void |
FastHypervolume.computeHVContributions(List<? extends Solution> solutionList)
Computes the HV contribution of the solutions
|
double |
FastHypervolume.computeHypervolume(List<? extends Solution> solutionList) |
double |
FastHypervolume.computeHypervolume(List<? extends Solution> solutionList,
Point referencePoint) |
double |
FastHypervolume.computeSolutionHVContribution(List<? extends Solution> solutionList,
int solutionIndex,
double solutionSetHV)
Computes the HV contribution of a solutiontype in a solutiontype set.
|
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 |
Solution.copy() |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractGenericSolution<T,P extends Problem>
Created by Antonio J.
|
class |
DefaultIntegerPermutationSolution
Created by Antonio J.
|
class |
GenericBinarySolution
Defines an implementation of a binary solution
Created by Antonio J.
|
class |
GenericDoubleBinarySolution
Created by Antonio J.
|
class |
GenericDoubleSolution
Created by Antonio J.
|
class |
GenericIntegerDoubleSolution
Created by Antonio J.
|
class |
GenericIntegerPermutationSolution
Created by Antonio J.
|
class |
GenericIntegerSolution
Created by Antonio J.
|
| Modifier and Type | Method and Description |
|---|---|
Solution |
GenericIntegerSolution.copy() |
Solution |
GenericIntegerPermutationSolution.copy() |
Solution |
GenericIntegerDoubleSolution.copy() |
Solution |
GenericDoubleSolution.copy() |
Solution |
GenericDoubleBinarySolution.copy() |
Solution |
GenericBinarySolution.copy() |
Solution |
DefaultIntegerPermutationSolution.copy() |
| Modifier and Type | Class and Description |
|---|---|
class |
AdaptiveGrid<T 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.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<S> solutionSet) |
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 Solution |
SolutionListUtils.findBestSolution(List<? extends Solution> solutionList,
Comparator<Solution> comparator) |
static Solution |
SolutionUtils.getBestSolution(Solution solution1,
Solution solution2,
Comparator comparator)
Return the best solution between those passed as arguments.
|
| 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 Solution |
SolutionUtils.getBestSolution(Solution solution1,
Solution solution2,
Comparator comparator)
Return the best solution between those passed as arguments.
|
static Solution |
SolutionUtils.getBestSolution(Solution solution1,
Solution solution2,
Comparator comparator)
Return the best solution between those passed as arguments.
|
| Modifier and Type | Method and Description |
|---|---|
static Solution |
SolutionListUtils.findBestSolution(List<? extends Solution> solutionList,
Comparator<Solution> comparator) |
static Solution |
SolutionListUtils.findBestSolution(List<? extends Solution> solutionList,
Comparator<Solution> comparator) |
static int |
SolutionListUtils.findIndexOfBestSolution(List<? extends Solution> solutionList,
Comparator<Solution> comparator)
Finds the index of the best solution in the list according to a comparator
|
static int |
SolutionListUtils.findIndexOfBestSolution(List<? extends Solution> solutionList,
Comparator<Solution> comparator)
Finds the index of the best 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 int |
SolutionListUtils.findIndexOfWorstSolution(List<? extends Solution> solutionList,
Comparator<Solution> comparator)
Finds the index of the worst solution in the list according to a comparator
|
int |
SolutionListUtils.findWorstSolution(List<? extends Solution> solutionList,
Comparator<Solution> comparator) |
int |
SolutionListUtils.findWorstSolution(List<? extends Solution> solutionList,
Comparator<Solution> comparator) |
static List<Double> |
SolutionListUtils.getMaximumValues(List<Solution> solutionList)
Gets the maximum values for each objectives in a given list of solutions
|
static List<Double> |
SolutionListUtils.getMinimumValues(List<Solution> solutionList)
Gets the minimum values for each objectives in a given list of solutions
|
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 | Class and Description |
|---|---|
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. |
| Modifier and Type | Method and Description |
|---|---|
int |
StrengthFitnessComparator.compare(Solution solution1,
Solution solution2) |
int |
StrengthFitnessComparator.compare(Solution solution1,
Solution solution2) |
int |
RankingComparator.compare(Solution solution1,
Solution solution2)
Compares two solutions according to the ranking attribute.
|
int |
RankingComparator.compare(Solution solution1,
Solution solution2)
Compares two solutions according to the ranking attribute.
|
int |
RankingAndCrowdingDistanceComparator.compare(Solution solution1,
Solution solution2)
Compares two solutions.
|
int |
RankingAndCrowdingDistanceComparator.compare(Solution solution1,
Solution solution2)
Compares two solutions.
|
int |
ObjectiveComparator.compare(Solution solution1,
Solution solution2)
Compares two solutions according to a given objective.
|
int |
ObjectiveComparator.compare(Solution solution1,
Solution solution2)
Compares two solutions according to a given objective.
|
int |
HypervolumeContributorComparator.compare(Solution solution1,
Solution solution2)
Compare two solutions.
|
int |
HypervolumeContributorComparator.compare(Solution solution1,
Solution solution2)
Compare two solutions.
|
int |
EqualSolutionsComparator.compare(Solution object1,
Solution object2)
Compares two solutions.
|
int |
EqualSolutionsComparator.compare(Solution object1,
Solution object2)
Compares two solutions.
|
int |
DominanceComparator.compare(Solution solution1,
Solution solution2)
Compares two solutions.
|
int |
DominanceComparator.compare(Solution solution1,
Solution solution2)
Compares two solutions.
|
int |
CrowdingDistanceComparator.compare(Solution solution1,
Solution solution2)
Compare two solutions.
|
int |
CrowdingDistanceComparator.compare(Solution solution1,
Solution solution2)
Compare two solutions.
|
int |
ConstraintViolationComparator.compare(Solution solution1,
Solution solution2) |
int |
ConstraintViolationComparator.compare(Solution solution1,
Solution solution2) |
| Modifier and Type | Class and Description |
|---|---|
class |
ViolationThresholdComparator<S extends Solution> |
| Modifier and Type | Method and Description |
|---|---|
int |
ViolationThresholdComparator.compare(Solution solution1,
Solution solution2)
Compares two solutions.
|
int |
ViolationThresholdComparator.compare(Solution solution1,
Solution solution2)
Compares two solutions.
|
int |
OverallConstraintViolationComparator.compare(Solution solution1,
Solution solution2)
Compares two solutions.
|
int |
OverallConstraintViolationComparator.compare(Solution solution1,
Solution solution2)
Compares two solutions.
|
boolean |
ViolationThresholdComparator.needToCompare(Solution solution1,
Solution solution2)
Returns true if solutions s1 and/or s2 have an overall constraint
violation with value less than 0
|
boolean |
ViolationThresholdComparator.needToCompare(Solution solution1,
Solution solution2)
Returns true if solutions s1 and/or s2 have an overall constraint
violation with value less than 0
|
| 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 | Method and Description |
|---|---|
static void |
SolutionSetOutput.printObjectivesToFile(FileOutputContext context,
List<Solution> solutionSet) |
static void |
SolutionSetOutput.printObjectivesToFile(List<Solution> solutionSet,
String fileName) |
static void |
SolutionSetOutput.printVariablesToFile(FileOutputContext context,
List<Solution> solutionSet) |
static void |
SolutionSetOutput.printVariablesToFile(List<Solution> solutionSet,
String fileName) |
| Constructor and Description |
|---|
Printer(List<? extends Solution> solutionSet) |
| Constructor and Description |
|---|
ArrayFront(List<? extends Solution> solutionList)
Constructor
|
| Modifier and Type | Class and Description |
|---|---|
class |
PointSolution
Solution used to wrap a Point object.
|
| Modifier and Type | Method and Description |
|---|---|
Solution |
PointSolution.copy() |
| 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 |
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> |
| Modifier and Type | Method and Description |
|---|---|
List<Solution> |
DominanceRanking.getSubfront(int rank) |
| Modifier and Type | Method and Description |
|---|---|
V |
GenericSolutionAttribute.getAttribute(Solution solution) |
Integer |
DominanceRanking.getAttribute(Solution solution) |
void |
DominanceRanking.setAttribute(Solution solution,
Integer value) |
| Modifier and Type | Method and Description |
|---|---|
Ranking |
DominanceRanking.computeRanking(List<Solution> solutionSet) |
Copyright © 2015. All rights reserved.