All Classes
| Class | Description |
|---|---|
| AbstractAlgorithmRunner |
Abstract class for Runner classes
|
| AbstractBinaryProblem | |
| AbstractBoundedArchive<S extends Solution<?>> | |
| AbstractCoralReefsOptimization<S,R> |
Abstract class representing a Coral Reefs Optimization Algorithm
Reference: S.
|
| AbstractCoralReefsOptimization.Coordinate |
Represents a Coordinate in Coral Reef Grid
|
| AbstractDifferentialEvolution<Result> |
Abstract class representing differential evolution (DE) algorithms
|
| AbstractDoubleProblem | |
| AbstractEvolutionaryAlgorithm<S,R> |
Abstract class representing an evolutionary algorithm
|
| AbstractEvolutionStrategy<S,Result> |
Abstract class representing an evolution strategy algorithm
|
| AbstractGenericProblem<S> | |
| AbstractGeneticAlgorithm<S,Result> |
Abstract class representing a genetic algorithm
|
| AbstractIntegerPermutationProblem | |
| AbstractIntegerProblem | |
| AbstractParticleSwarmOptimization<S,Result> |
Abstract class representing a PSO algorithm
|
| AbstractScatterSearch<S,R> |
Abstract class representing a scatter search algorithm
|
| AbstractSolution<T> |
Abstract class representing a generic solution
|
| AdaptiveGrid<S extends Solution<?>> |
This class defines an adaptive grid over a list of solutions as the one used by algorithm PAES.
|
| AdaptiveRandomNeighborhood<S> |
This class implements the adaptive random neighborhood (topology) defined by M.
|
| AggregativeFunction | |
| Algorithm<Result> |
Interface representing an algorithm
|
| AlgorithmBuilder<A extends Algorithm<?>> |
Interface representing algorithm builders
|
| AlgorithmDefaultOutputData | |
| Archive<S> |
Interface representing an archive of solutions
|
| ArchiveWithReferencePoint<S extends Solution<?>> |
This class defines a bounded archive that has associated a reference point as described in the paper
"Extending the Speed-constrained Multi-Objective PSO (SMPSO) With Reference Point Based Preference Articulation
Accepted in PPSN 2018.
|
| ArrayFront | |
| ArrayPoint |
Class representing a point (i.e, an array of double values)
|
| ArtificialDecisionMaker<S,R> | |
| 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).
|
| ArtificiallDecisionMakerBuilder<S extends Solution<?>> | |
| Attribute<S> | |
| AttributeComparator<S extends Solution<?>> |
Compares two population according to an attribute value, which must be a double number.
|
| AttributeComparator.Ordering | |
| AuditableRandomGenerator |
An
AuditableRandomGenerator is a PseudoRandomGenerator which can be audited
to know when a random generation method is called. |
| AuditableRandomGenerator.Audit | |
| AuditableRandomGenerator.Bounds | |
| AuditableRandomGenerator.RandomMethod | |
| BasicLocalSearch<S extends Solution<?>> |
This class implements a basic local search operator based in the use of a mutation operator.
|
| BasicMeasure<T> |
A
BasicMeasure provides a simple way to define a
measure that merely stores a single value |
| BestSolutionSelection<S> |
This class implements a selection operator used for selecting the best solution
in a list according to a given comparator.
|
| BinaryProblem |
Interface representing binary problems
|
| BinarySet |
Class representing a bit set including a method to get the total number of bits
|
| BinarySolution |
Interface representing binary (bitset) solutions
|
| 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.
|
| BitFlipMutation | |
| BLXAlphaCrossover |
This class allows to apply a BLX-alpha crossover operator to two parent solutions.
|
| BoundedArchive<S> |
Interface representing a bounded archive of solutions
|
| BoundedProblem<T extends java.lang.Number & java.lang.Comparable<T>,S> |
A
BoundedProblem is a Problem for which solution boundaries
exist. |
| BoundedRandomGenerator<Value extends java.lang.Comparable<Value>> |
A
BoundedRandomGenerator aims to provide a random value within a
specific range. |
| Bounds<T extends java.lang.Comparable<T>> |
Describes a pair of lower and upper bounds for a
Comparable value. |
| 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.
|
| 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.
|
| C9<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.
|
| CDGMutation |
This class implements a polynomial mutation operator
The implementation is based on the NSGA-II code available in
http://www.iitk.ac.in/kangal/codes.shtml
If the lower and upper bounds of a variable are the same, no mutation is carried out and the
bound value is returned.
|
| CharSequenceProblem | |
| CharSequenceRandomMutation |
This class implements a swap mutation.
|
| CharSequenceSolution |
Defines an implementation of solution representing sequences of chars.
|
| ChartContainer |
Class for configuring and displaying a XChart.
|
| ChartContainerWithReferencePoints |
Class for configuring and displaying a char with a number of subpopulations and reference points.
|
| ChartForDynamicProblemsContainer<S extends Solution<?>> |
Class for configuring and displaying a XChart.
|
| Check |
Static class for error checking
|
| CollectionGrouping<S> |
Interface representing objects that group collections according to some criterion
|
| CommandLineQualityIndicatorTool |
Class for executing quality indicators from the command line.
|
| ComposableDoubleProblem |
This class allows to define a continuous (double) problem dynamically, by adding the ranges of
every decision variable, the objective functions and the constraints.
|
| CompositeCrossover |
This class allows to apply a list of crossover operator on the solutions belonging to a list of
CompositeSolution objects. |
| CompositeMutation |
This class allows to apply a list of crossover operator on the solutions belonging to a list of
CompositeSolution objects. |
| CompositeSolution |
Class representing solutions composed of a list of solutions.
|
| ConstraintHandling | |
| ConstraintViolationComparator<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. |
| CosineDistanceBetweenSolutionsInObjectiveSpace<S extends Solution<?>> |
Class for calculating the cosine distance between two
Solution objects in objective space. |
| CosineSimilarityBetweenVectors |
Class for calculating the cosine similarity between two vectors.
|
| CosineSimilarityDensityEstimator<S extends Solution<?>> |
This class implements the a density estimator based on the cosine similarity
|
| CountingMeasure |
A
CountingMeasure provides a simple way to evaluate a number of
occurrences. |
| CreateNewSolutionsStrategy<S extends Solution<?>> | |
| CreateNRandomSolutions<S extends Solution<?>> |
Created by antonio on 6/06/17.
|
| CrossoverOperator<Source> |
Interface representing crossover operators.
|
| CrowdingDistanceArchive<S extends Solution<?>> |
Created by Antonio J.
|
| CrowdingDistanceArchiveWithReferencePoint<S extends Solution<?>> |
Class representing a
ArchiveWithReferencePoint archive using a crowding distance based density estimator |
| CrowdingDistanceDensityEstimator<S extends Solution<?>> |
This class implements the crowding distance
|
| DecisionTreeEstimator<S extends Solution<?>> | |
| DefaultBinarySolution |
This defines an implementation of a binary solution.
|
| DefaultDoubleSolution |
Defines an implementation of a double solution.
|
| DefaultFileOutputContext |
Class using the default method for getting a buffered writer
|
| DefaultIntegerDoubleSolution | Deprecated. |
| DefaultIntegerSolution |
Defines an implementation of an integer solution
|
| DefaultLocalSearch<S extends Solution<?>> |
Abstract class representing a local search algorithm
|
| DefaultObservable<D> | |
| DefaultRestartStrategy<S extends Solution<?>> |
Created by antonio on 6/06/17.
|
| DensityEstimator<S> |
Interface representing implementations to compute the crowding distance
|
| DensityEstimator<S> | Deprecated. |
| DescribedEntity |
A
DescribedEntity is identified through its name (DescribedEntity.getName())
and further detailed through its description (DescribedEntity.getDescription()). |
| DescribedEntitySet<Entity extends DescribedEntity> | |
| DifferentialEvolutionCrossover |
Differential evolution crossover operator
|
| DifferentialEvolutionCrossover.DE_CROSSOVER_TYPE | |
| DifferentialEvolutionCrossover.DE_MUTATION_TYPE | |
| DifferentialEvolutionCrossover.DE_VARIANT | |
| DifferentialEvolutionSelection |
Class implementing the selection operator used in DE: a number of different solutions are
returned from a population.
|
| DirScore<S extends Solution<?>> |
created at 11:09 pm, 2019/1/28
Estimate DIR scores for solutions, used in D-NSGA-II
|
| DirScoreComparator<S extends Solution<?>> |
created at 10:34 pm, 2019/1/28 The comparator of DIR score used in D-NSGA-II
|
| Distance<E,J> |
Interface representing distances between two entities
|
| DistanceBetweenSolutionAndKNearestNeighbors<S extends Solution<?>> |
Class for calculating the Euclidean distance between two
DoubleSolution objects in solution space. |
| DistanceToSolutionListAttribute |
Created by cbarba on 24/3/15.
|
| DominanceComparator<S extends Solution<?>> |
This class implements a solution comparator taking into account the violation constraints
|
| DominanceComparatorV2<S extends Solution<?>> |
This class implements a solution comparator for dominance checking
|
| DominanceDistanceBetweenVectors |
Class for calculating the dominance distance between two vectors
|
| DoubleProblem |
Interface representing continuous problems
|
| DoubleSolution |
Interface representing a double solutions
|
| DoubleValueAttributeComparator<S extends Solution<?>> |
Compares two population according to an attribute value, which must be a double number.
|
| DoubleVariableComparator | |
| DummyDoubleProblem |
Implementation of
DoubleProblem that does nothing. |
| DurationMeasure |
This measure allows to have a simple way to compute the time spent in doing
something.
|
| DynamicAlgorithm<Result> | |
| DynamicProblem<S extends Solution<?>,D> |
Interface representing dynamic problems.
|
| EmptyCollectionException | |
| Epsilon |
This class implements the unary epsilon additive indicator as proposed in E.
|
| EpsilonDominanceComparator<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)
|
| 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. |
| ErrorRatio |
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.
|
| EuclideanDistanceBetweenSolutionAndASolutionListInObjectiveSpace<S extends Solution<?>,L extends java.util.List<S>> | |
| EuclideanDistanceBetweenSolutionsInObjectiveSpace<S extends Solution<?>> |
Class for calculating the Euclidean distance between two
Solution objects in objective space. |
| EuclideanDistanceBetweenSolutionsInSolutionSpace<S extends Solution<java.lang.Double>> |
Class for calculating the Euclidean distance between two
DoubleSolution objects in solution space. |
| EuclideanDistanceBetweenVectors |
Class for calculating the Euclidean distance between two vectors
|
| EvaluationObserver |
This observer prints the current evaluation number of an algorithm.
|
| ExperimentalFastNonDominanceRanking<S extends Solution<?>> |
This is an implementation of the
Ranking interface using non-dominated sorting algorithms
from the non-dominated sorting repository. |
| ExtendedPseudoRandomGenerator |
Extended pseudo random number generator based on the decorator pattern.
|
| ExternalArchiveObserver<S extends Solution<?>> |
This observer add the solutions of population to an archive.
|
| ExtractParetoDominatingSolutionsFromFile |
This utility takes an input file and produces an output file containing only the non-dominated
solutions in the input file
|
| ExtremeValuesFinder<Source,Result> |
Interface representing classes aimed at finding the extreme values of Source objects (e.g., lists)
|
| FastNonDominatedSortRanking<S extends Solution<?>> |
This class implements a solution list ranking based on dominance ranking.
|
| FileOutputContext |
This interface represents output contexts, which are classes providing a mean for getting a
buffer reader object.
|
| Fitness<S extends Solution<?>> | |
| 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. |
| Front | Deprecated. |
| FrontExtremeValues |
Class for finding the extreme values of front objects
|
| FrontNormalizer | Deprecated. |
| FrontUtils | Deprecated. |
| 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)
|
| GeneralizedSpread |
This class implements the generalized spread metric for two or more dimensions.
|
| GenerateReferenceFrontFromFile |
This utility reads a file or the files in a directory and creates a reference front.
|
| GenerationalDistance |
This class implements the generational distance indicator.
|
| GenericBoundedArchive<S extends Solution<?>> |
This class implements a generic bound archive.
|
| GenericChartContainer<S extends Solution<?>> |
Class for configuring and displaying a XChart.
|
| GenericIndicator<S> | Deprecated. |
| GenericSolutionAttribute<S extends Solution<?>,V> |
Generic class for implementing
SolutionAttribute classes. |
| GridDensityEstimator<S extends Solution<?>> |
This class implements the a density estimator based on the adaptive grid scheme used in the PAES algorithm.
|
| GroupedAndLinkedPolynomialMutation |
This class implements the grouped and linked polynomial mutation operator presented in:
https://doi.org/10.1109/SSCI.2016.7850214
|
| GroupedPolynomialMutation |
This class implements the grouped polynomial mutation operator presented in:
https://doi.org/10.1109/SSCI.2016.7850214
|
| HUXCrossover |
This class allows to apply a HUX crossover operator using two parent solutions.
|
| Hypervolume |
This interface represents implementations of the Hypervolume quality indicator
|
| Hypervolume<S> | Deprecated. |
| HypervolumeArchive<S extends Solution<?>> |
Created by Antonio J.
|
| HypervolumeArchiveWithReferencePoint<S extends Solution<?>> |
Class representing a
ArchiveWithReferencePoint archive using a hypervolume contribution based
density estimator. |
| HypervolumeContributionAttribute<S extends Solution<?>> | |
| HypervolumeContributionComparator<S extends Solution<?>> |
Compares two solutions according to the crowding distance attribute.
|
| HypervolumeContributionDensityEstimator<S extends Solution<?>> |
This class implements a density estimator based on the hypervolume contribution
|
| IdealPoint |
d
Class representing an ideal point (minimization is assumed)
|
| IntegerBoundedSequenceGenerator |
This class generates a bounded sequence of consecutive integer numbers.
|
| IntegerDoubleSBXCrossover | Deprecated. |
| IntegerDoubleSolution | Deprecated. |
| IntegerPermutationGenerator | |
| IntegerPermutationSolution |
Defines an implementation of solution composed of a permutation of integers.
|
| IntegerPolynomialMutation |
This class implements a polynomial mutation operator to be applied to Integer solutions
If the lower and upper bounds of a variable are the same, no mutation is carried out and the
bound value is returned.
|
| IntegerProblem |
Interface representing integer problems
|
| IntegerSBXCrossover |
This class allows to apply a SBX crossover operator using two parent solutions (Integer encoding)
|
| IntegerSolution |
Interface representing a integer solutions
|
| IntegerValueAttributeComparator<S extends Solution<?>> |
Compares two population according to an attribute value, which must be a double number.
|
| IntegerVariableComparator | |
| InteractiveAlgorithm<S,R> | |
| InvalidConditionException | |
| InvalidProbabilityValueException | |
| InvertedGenerationalDistance |
This class implements the inverted generational distance metric.
|
| InvertedGenerationalDistancePlus |
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
|
| JavaRandomGenerator | |
| JMetalException |
jMetal exception class
|
| JMetalLogger |
This class provides some facilities to manage loggers.
|
| JMetalRandom | |
| KNearestNeighborhood<S extends Solution<?>> |
This class implements a neighborhood that select the k-nearest solutions according to a
distance measure.
|
| KnnDensityEstimator<S extends Solution<?>> |
This class implements the a density estimator based on the distance to the k-th nearest solution
|
| 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.
|
| L25<S extends Solution<?>> |
Class representing neighborhoods for a solution into a list of solutions
|
| L41<S extends Solution<?>> |
Class representing neighborhoods for a solution into a list of solutions
|
| L5<S extends Solution<?>> |
Class defining an L5 neighborhood of a solution belonging to a list of solutions which is
structured as a bi-dimensional mesh.
|
| LastEvaluationMeasure<Solution,Value> |
LastEvaluationMeasure is a PushMeasure providing the last
evaluation made in an algorithm. |
| LastEvaluationMeasure.Evaluation<Solution,Value> |
This structure represent an atomic evaluation of a given solution.
|
| LexicographicalPointComparator |
This class implements the Comparator interface for comparing two points.
|
| LexicographicalVectorComparator |
This class implements the Comparator interface for comparing two vectors.
|
| LinkedPolynomialMutation |
This class implements the linked polynomial mutation operator presented in: https://doi.org/10.1109/SSCI.2016.7850214
|
| ListenerTimeMeasure |
This measure is a facility to evaluate the time spent in
MeasureListeners registered in PushMeasures. |
| ListGrouping<C extends java.lang.Comparable<C>> |
Abstract class that groups a list of
Comparable entities by some order in the collection. |
| ListLinearGrouping<C extends java.lang.Comparable<C>> |
Class that groups a list of
Comparable entities by order in the collection. |
| ListOrderedGrouping<C extends java.lang.Comparable<C>> |
Class that groups a list of
Comparable entities by ascending order. |
| LocalSearchOperator<Source> |
Interface representing a local search operator
Created by cbarba on 5/3/15.
|
| LocationAttribute<S extends Solution<?>> |
Assign to each solution in a solution list an attribute containing the position of
the solutions in the list.
|
| Measurable |
A
Measurable entity is an entity which provides one or several
Measures. |
| Measure<Value> | |
| MeasureFactory |
The
MeasureFactory provides some useful methods to build specific
Measures. |
| MeasureListener<Value> |
A
MeasureListener allows to register a given behavior to
PushMeasure.register(MeasureListener). |
| MeasureManager |
A
MeasureManager aims at managing a set of Measures. |
| MergeNonDominatedSortRanking<S extends Solution<?>> |
This class implements a solution list ranking based on dominance ranking.
|
| MersenneTwisterGenerator | |
| MNDSBitsetManager |
This class implements a simple bitset adapted to the Merge Non-dominated Sorting (MNDS) algorithm
Please, note that in MNDS the size of a bitset can only be reduced or remain the same
|
| MultiComparator<T> | |
| MultiThreadedSolutionListEvaluator<S> | |
| MutationOperator<Source> |
Interface representing mutation operators
|
| NadirPoint |
Class representing a nadir point (minimization is assumed)
|
| NaryRandomSelection<S> |
This class implements a random selection operator used for selecting randomly N solutions from a
list
|
| 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.
|
| Neighborhood<S> |
Interface representing a neighborhood of a given solution in a list of solutions
|
| Neighborhood.NeighborType | |
| NonDominatedSolutionListArchive<S extends Solution<?>> |
This class implements an archive containing non-dominated solutions
|
| NonUniformMutation |
This class implements a non-uniform mutation operator.
|
| NormalizedHypervolume |
Class providing an implementation of the normalized hypervolume, which is calculated as follows:
relative hypervolume = 1 - (HV of the front / HV of the reference front).
|
| NormalizeUtils |
Class responsible for normalizing values
|
| NPointCrossover<T> |
Created by FlapKap on 23-03-2017.
|
| NullCrossover<S extends Solution<?>> |
This class defines a null crossover operator: the parent solutions are returned without any
change.
|
| NullEvaluator<S> | |
| NullMutation<S> |
This class is intended to perform no mutation.
|
| NullParameterException | |
| NumberOfViolatedConstraints<S extends Solution<?>> | |
| ObjectiveComparator<S extends Solution<?>> |
This class implements a comparator based on a given objective
|
| ObjectiveComparator.Ordering | |
| Observable<D> |
Interface representing observable entities according to the Observer Pattern
|
| ObservableEntity |
Interface representing observable entities according to the Observer Pattern
|
| Observer<D> |
Interface representing observers according to the Observer Pattern
|
| Operator<Source,Result> |
Interface representing an operator
|
| OverallConstraintViolation<S extends Solution<?>> | |
| PenaltyBoundaryIntersection | |
| PermutationProblem<S extends PermutationSolution<?>> |
Interface representing permutation problems
|
| PermutationSolution<T> |
Interface representing permutation based solutions
|
| PermutationSwapMutation<T> |
This class implements a swap mutation.
|
| PISAHypervolume |
This class implements the hypervolume indicator.
|
| PISAHypervolume<S extends Solution<?>> | Deprecated. |
| PMXCrossover |
This class allows to apply a PMX crossover operator using two parent solutions.
|
| Point |
Interface representing a point
|
| PointDimensionComparator |
This class implements the
Comparator interface. |
| PointSolution |
Solution used to wrap a
Point object. |
| PolynomialMutation |
This class implements a polynomial mutation operator
|
| PreferenceDistance<S extends Solution<?>> | |
| PrintObjectivesObserver |
This observer prints the current evaluation number of an algorithm.
|
| Problem<S> |
Interface representing a multi-objective optimization problem
|
| ProblemUtils | |
| PseudoRandomGenerator | |
| PullMeasure<Value> |
A
PullMeasure is a Measure from which the PullMeasure can
be accessed on demand through the PullMeasure.get() method. |
| PullPushMeasure<Value> |
A
PullPushMeasure aims at providing both the PushMeasure and
PullMeasure abilities into a single Measure. |
| PushMeasure<Value> | |
| QualityIndicator | |
| QualityIndicator<Evaluate,Result> | Deprecated. |
| QualityIndicatorUtils | |
| RandomGenerator<Value> |
A
RandomGenerator aims to provide a random value of a given type. |
| RandomSelection<S> |
This class implements a random selection operator used for selecting randomly a solution from a list
|
| Ranking<S> |
Ranks a list of population according to the dominance relationship
|
| RankingAndCrowdingDistanceComparator<S extends Solution<?>> | |
| RankingAndCrowdingSelection<S extends Solution<?>> |
This class implements a selection for selecting a number of solutions from
a solution list.
|
| RankingAndDirScoreDistanceComparator<S extends Solution<?>> |
created at 10:29 pm, 2019/1/28 Comparator combining dominance-ranking comparator and DIR-score
comparator
|
| RankingAndDirScoreSelection<S extends Solution<?>> |
created at 11:47 am, 2019/1/29 Used for DIR-enhanced NSGA-II (D-NSGA-II) to select the joint
solutions for next iteration this code implemented according to "Cai X, Sun H, Fan Z.
|
| RankingAndPreferenceSelection<S extends Solution<?>> | |
| RankingAndSSDComparator<S extends Solution<?>> | |
| RemoveFirstNSolutions<S extends Solution<?>> |
Created by antonio on 6/06/17.
|
| RemoveNRandomSolutions<S extends Solution<?>> |
Created by antonio on 6/06/17.
|
| RemoveNSolutionsAccordingToTheCrowdingDistance<S extends Solution<?>> |
Created by antonio on 6/06/17.
|
| RemoveNSolutionsAccordingToTheHypervolumeContribution<S extends Solution<?>> |
Created by antonio on 6/06/17.
|
| RemoveSolutionsStrategy<S extends Solution<?>> | |
| RepairDoubleSolution | |
| RepairDoubleSolutionWithBoundValue | |
| RepairDoubleSolutionWithOppositeBoundValue | |
| RepairDoubleSolutionWithRandomValue | |
| RestartStrategy<S extends Solution<?>> |
Created by antonio on 6/06/17.
|
| RunTimeChartObserver<S extends Solution<?>> |
This observer prints a chart in real time showing the current Pareto front approximation produced
by an algorithm.
|
| RunTimeForDynamicProblemsChartObserver<S extends Solution<?>> |
This observer prints a chart in real time showing the current Pareto front approximation produced
by an algorithm.
|
| SBXCrossover |
This class allows to apply a SBX crossover operator using two parent solutions (Double encoding).
|
| SelectionOperator<Source,Result> |
Interface representing selection operators
|
| SequenceGenerator<T> | |
| SequenceProblem<S extends SequenceSolution<?>> | |
| SequenceSolution<T> |
Interface representing a sequence of values of the same type
|
| SequentialSolutionListEvaluator<S> | |
| SetCoverage |
Set coverage metric
|
| SimpleDescribedEntity |
SimpleDescribedEntity is a basic implementation of DescribedEntity. |
| SimpleMeasure<Value> |
SimpleMeasure is a basic implementation of Measure. |
| SimpleMeasureManager |
This
SimpleMeasureManager provides a basic implementation to manage a
collection of Measures. |
| SimplePullMeasure<Value> |
SimplePullMeasure is a basic implementation of PullMeasure. |
| SimplePushMeasure<Value> |
SimplePushMeasure is a basic implementation of PushMeasure. |
| SimpleRandomMutation |
This class implements a random mutation operator for double solutions
|
| SinglePointCrossover |
This class implements a single point crossover operator.
|
| Solution<T> |
Interface representing a Solution
|
| SolutionAttribute<S,V> | Deprecated. |
| SolutionListEvaluator<S> |
Created by Antonio J.
|
| SolutionListExtremeValues |
Class for finding the extreme values of a list of objects
|
| SolutionListOutput | |
| SolutionListUtils | |
| SolutionTextRepresentation | |
| SolutionUtils |
Created by Antonio J.
|
| SpatialSpreadDeviation<S extends Solution<?>> |
This class implements the Spatial Spread Deviation density estimator
|
| SpatialSpreadDeviationArchive<S extends Solution<?>> | |
| SpatialSpreadDeviationComparator<S extends Solution<?>> |
Compares two solutions according to the Spatial Spread Deviation attribute.
|
| SpatialSpreadDeviationDensityEstimator<S extends Solution<?>> |
This class implements the a density estimator based on the distance to the k-th nearest solution
|
| SpatialSpreadDeviationSelection<S extends Solution<?>> |
Spatial Spread Deviation selection operator
|
| Spread |
This class implements the spread quality indicator.
|
| StoredSolutionsUtils | |
| StrenghtRawFitnessDensityEstimator<S extends Solution<?>> |
This class implements the a density estimator based on the distance to the k-th nearest solution
|
| StrengthRanking<S extends Solution<?>> |
This class implements a solution list ranking based on the strength concept defined in SPEA2.
|
| Termination |
This interface represents classes that isMet the termination condition of an algorithm.
|
| TerminationByComputingTime |
Class that allows to check the termination condition when the computing time of an algorithm
gets higher than a given threshold.
|
| TerminationByEvaluations |
Class that allows to check the termination condition based on a maximum number of indicated
evaluations.
|
| TerminationByKeyboard |
Class that allows to check the termination condition based on introducing a character by keyboard.
|
| TerminationByQualityIndicator |
Class that allows to check the termination condition when current front is above a given
percentage of the value of a quality indicator applied to a reference front
|
| TournamentSelection<S extends Solution<?>> | Deprecated. |
| Tschebyscheff | |
| TSVToCSVConverter |
This utility reads a TSV file and generates another file in CSV format
|
| TwoDimensionalMesh<S> |
Class defining a bi-dimensional mesh.
|
| TwoPointCrossover<T> |
Created by FlapKap on 27-05-2017.
|
| UniformCrossover |
This class implements a uniform crosoover operator for binary solutions.
|
| UniformMutation |
This class implements a uniform mutation operator.
|
| ValueOutOfRangeException | |
| VectorFileUtils |
created at 3:49 pm, 2019/1/29 the common util to read reference vectors/reference points/uniform
weight vectors from file
Modified by Antonio J.
|
| VectorUtils | |
| WeightedSum | |
| WeightVectorNeighborhood<S extends Solution<?>> |
This class implements a neighborhood based on the weight vectors of MOEA/D
|
| Well44497bGenerator | |
| WFGHypervolume |
This class implements the hypervolume indicator developed by the WFG
|
| WFGHypervolume<S extends Solution<?>> | Deprecated. |
| WholeArithmeticCrossover |
This class allows to apply a whole arithmetic crossover operator to two parent solutions.
|
| WriteSolutionsToFilesObserver |
This observer stores a solution list in files.
|