All Classes and Interfaces
Class
Description
Abstract class for Runner classes
Abstract class representing a Coral Reefs Optimization Algorithm
Reference: S.
Represents a Coordinate in Coral Reef Grid
Abstract class representing differential evolution (DE) algorithms
Abstract class to be extended by implementations of interface
}, which must
implement the
invalid @link
{@link DoubleProblem>
Problem.evaluate(S) method.Abstract class representing an evolutionary algorithm
Abstract class representing an evolution strategy algorithm
Abstract class representing a genetic algorithm
Abstract class to be extended by implementations of interface
>Abstract class representing a PSO algorithm
Abstract class representing a scatter search algorithm
Abstract class representing a generic solution
This class defines an adaptive grid over a list of solutions as the one used by algorithm PAES.
This class implements the adaptive random neighborhood (topology) defined by M.
Interface representing an algorithm
Interface representing algorithm builders
Interface representing an archive of solutions
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.
Class representing a point (i.e, an array of double values)
Class implementing the
Towards automatic testing of reference point based interactive methods described in:
Ojalehto, V., Podkopaev, D., invalid input: '&' Miettinen, K. (2016, September).
An
AuditableRandomGenerator is a PseudoRandomGenerator which can be audited
to know when a random generation method is called.This class implements a basic local search operator based in the use of a mutation operator.
A
BasicMeasure provides a simple way to define a
measure that merely stores a single valueArchive that select the best solutions of another archive by applying the
SolutionListUtils.distanceBasedSubsetSelection(List, int)} function.This class implements a selection operator used for selecting the best solution
in a list according to a given comparator.
Interface representing binary problems
Class representing a bit set including a method to get the total number of bits
Interface representing binary (bitset) solutions
Applies a binary tournament selection to return the best solution between two that have been
chosen at random from a solution list.
This class allows to apply a BLX-alpha crossover operator to two parent solutions.
Interface representing a bounded archive of solutions
A
BoundedRandomGenerator aims to provide a random value within a
specific range.Describes a pair of lower and upper bounds for a
Comparable value.Class defining an C25 neighborhood of a solution belonging to a list of solutions which is
structured as a bi-dimensional mesh.
Class defining an C49 neighborhood of a solution belonging to a list of solutions which is
structured as a bi-dimensional mesh.
Class defining an L9 neighborhood of a solution belonging to a list of solutions which is
structured as a bi-dimensional mesh.
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.
This class implements a swap mutation.
Defines an implementation of solution representing sequences of chars.
Class for configuring and displaying a XChart.
Class for configuring and displaying a char with a number of subpopulations and reference points.
Class for configuring and displaying a XChart.
Static class for error checking
Interface representing objects that group collections according to some criterion
Class for executing quality indicators from the command line.
This class allows to define a continuous (double) problem dynamically, by adding the ranges of
every decision variable, the objective functions and the constraints.
This class allows to apply a list of crossover operator on the solutions belonging to a list of
CompositeSolution objects.This class allows to apply a list of crossover operator on the solutions belonging to a list of
CompositeSolution objects.Class representing solutions composed of a list of solutions.
Interface representing constraint comparators
This class offers a set of static methods for setting and getting information about constraints
in solutions.
The computing of the constraints can be precomputed when evaluating a solution.
Class for calculating the cosine similarity between two vectors.
This class implements a density estimator based on the cosine similarity
A
CountingMeasure provides a simple way to evaluate a number of
occurrences.Created by antonio on 6/06/17.
Interface representing crossover operators.
Created by Antonio J.
Class representing a
ArchiveWithReferencePoint archive using a crowding distance based density estimator that
takes into account the preferences of the decision make through a reference pointThis class implements the crowding distance
Cycle Crossover (CX) operator for permutation-based genetic algorithms.
This defines an implementation of a binary solution.
This class implements a solution comparator for dominance checking
Defines an implementation of the
DoubleSolution interfaceClass using the default method for getting a buffered writer
Defines an implementation of the
IntegerSolution interfaceCreated by antonio on 6/06/17.
Interface representing implementations to compute the crowding distance
Deprecated.
A
DescribedEntity is identified through its name (DescribedEntity.name())
and further detailed through its description (DescribedEntity.description()).Differential evolution crossover operator
Class implementing the selection operator used in DE: a number of different solutions are
returned from a population.
created at 11:09 pm, 2019/1/28
Estimate DIR scores for solutions, used in D-NSGA-II
created at 10:34 pm, 2019/1/28 The comparator of DIR score used in D-NSGA-II
Displacement Mutation operator for permutation-based genetic algorithms.
Interface representing distances between two entities
Class for calculating the Euclidean distance between two
DoubleSolution objects in solution space.Created by cbarba on 24/3/15.
Interface representing dominance comparators
Class for calculating the dominance distance between two vectors
This class implements a solution comparator taking into account the violation constraints
Interface representing continuous problems
Interface representing double solutions, where the variables are a list of bounded double values.
This measure allows to have a simple way to compute the time spent in doing
something.
Interface representing dynamic problems.
Edge Recombination Crossover (ERX) operator for permutation-based genetic algorithms.
This class implements the unary epsilon additive indicator as proposed in E.
This class implements a solution comparator taking into account the violation constraints and
an optional epsilon value (i.e, implements an epsilon dominance comparator)
This class implements a
Comparator (a method for comparing
Solution objects) based whether all the objective values are
equal or not.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 for calculating the Euclidean distance between two
Solution objects in objective space.Class for calculating the Euclidean distance between two
DoubleSolution objects in solution space.Class for calculating the Euclidean distance between two vectors
This observer prints the current evaluation number of an algorithm.
This is an implementation of the
Ranking interface using non-dominated sorting algorithms
from the non-dominated sorting repository.Extended pseudo random number generator based on the decorator pattern.
This observer add the solutions of population to an archive.
This utility takes an input file and produces an output file containing only the non-dominated
solutions in the input file
Each line of the file represents a solution.
This utility takes an input file containing non-dominated solutions and extract a number N of
uniformly distributed solutions from them.
Interface representing classes aimed at finding the extreme values of Source objects (e.g., lists)
Fake implementation of
BinaryProblem that does nothing.Fake implementation of
DoubleProblem that does nothing.Fake class representing a integer permutation problem.
Fake implementation of
IntegerProblem.This class implements a solution list ranking based on dominance ranking.
This interface represents output contexts, which are classes providing a mean for getting a
buffer reader object.
This class implements a
Comparator (a method for comparing
Solution objects) based on the fitness value returned by the
method getFitness.This observer prints the current best fitness of an algorithm.
Deprecated.
Class for finding the extreme values of front objects
Deprecated.
Deprecated.
This class implements a solution comparator according to the concept of g-dominance
(https://doi.org/10.1016/j.ejor.2008.07.015)
This class implements the generalized spread metric for two or more dimensions.
This utility reads a file or the files in a directory and creates a reference front.
This class implements the generational distance indicator.
This class implements a generic bound archive.
Class for configuring and displaying a XChart.
Deprecated.
Generic class for implementing
SolutionAttribute classes.This class implements the density estimator based on the adaptive grid scheme used in the PAES algorithm.
This class implements the grouped and linked polynomial mutation operator presented in:
https://doi.org/10.1109/SSCI.2016.7850214
This class implements the grouped polynomial mutation operator presented in:
https://doi.org/10.1109/SSCI.2016.7850214
This class allows to apply a HUX crossover operator using two parent solutions.
This interface represents implementations of the Hypervolume quality indicator
Deprecated.
Created by Antonio J.
Class representing a
ArchiveWithReferencePoint archive using a hypervolume contribution based
density estimator.Compares two solutions according to the crowding distance attribute.
This class implements a density estimator based on the hypervolume contribution
d
Class representing an ideal point (minimization is assumed)
Insert Mutation operator for permutation-based genetic algorithms.
This class generates a bounded sequence of consecutive integer numbers.
Defines an implementation of solution composed of a permutation of integers.
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.
Interface representing integer problems
This class allows to apply a SBX crossover operator using two parent solutions (Integer encoding)
Interface representing integer solutions, where the variables are a list of bounded integer values.
Inversion Mutation operator for permutation-based genetic algorithms.
This class implements the inverted generational distance metric.
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
jMetal exception class
This class implements a neighborhood that select the k-nearest solutions according to a
distance measure.
This class implements a density estimator based on the distance to the k-th nearest solution
Created by Antonio J.
Class defining an L9 neighborhood of a solution belonging to a list of solutions which is
structured as a bi-dimensional mesh.
Class representing neighborhoods for a solution into a list of solutions
Class representing neighborhoods for a solution into a list of solutions
Class defining an L5 neighborhood of a solution belonging to a list of solutions which is
structured as a bi-dimensional mesh.
LastEvaluationMeasure is a PushMeasure providing the last
evaluation made in an algorithm.This structure represent an atomic evaluation of a given solution.
This class implements the Comparator interface for comparing two points.
This class implements the Comparator interface for comparing two vectors.
This class implements the linked polynomial mutation operator presented in: https://doi.org/10.1109/SSCI.2016.7850214
This measure is a facility to evaluate the time spent in
MeasureListeners registered in PushMeasures.Abstract class that groups a list of
Comparable entities by some order in the collection.Class that groups a list of
Comparable entities by order in the collection.Class that groups a list of
Comparable entities by ascending order.Interface representing a local search operator
Created by cbarba on 5/3/15.
Assign to each solution in a solution list an attribute containing the position of
the solutions in the list.
A
Measurable entity is an entity which provides one or several
Measures.The
MeasureFactory provides some useful methods to build specific
Measures.A
MeasureListener allows to register a given behavior to
PushMeasure.register(MeasureListener).A
MeasureManager aims at managing a set of Measures.This class implements a solution list ranking based on dominance ranking.
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
Interface representing mutation operators
Class representing a nadir point (minimization is assumed)
This class implements a random selection operator used for selecting randomly N solutions from a
list
Applies a N-ary tournament selection to return the best solution between N that have been chosen
at random from a solution list.
Interface representing a neighborhood of a given solution in a list of solutions
This class implements an archive containing non-dominated solutions
This class implements a non-uniform mutation operator.
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).
Class responsible for normalizing values
Created by FlapKap on 23-03-2017.
This class defines a null crossover operator: the parent solutions are returned without any
change.
This class is intended to perform no mutation.
This class implements a
Comparator for Solution objects based on the number of
violated constraints of solutions.This class implements a comparator based on a given objective
Interface representing observable entities according to the Observer Pattern
Interface representing observable entities according to the Observer pattern
Interface representing observers according to the Observer Pattern
Interface representing an operator
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.Order-based Crossover with Duplicate Elimination (OXD) operator for permutation-based genetic
algorithms.
Interface representing permutation problems
Interface representing permutation based solutions
This class implements a swap mutation.
This class implements the hypervolume indicator.
Deprecated.
This class allows to apply a PMX crossover operator using two parent solutions.
Interface representing a point
This class implements the
Comparator interface.Solution used to wrap a point, i.e., an array of double values which are considered as objective
values.
This class implements a polynomial mutation operator
Position-Based Crossover operator for permutation-based genetic algorithms.
Interface representing a multi-objective optimization problem.
A
PullMeasure is a Measure from which the PullMeasure can
be accessed on demand through the PullMeasure.get() method.A
PullPushMeasure aims at providing both the PushMeasure and
PullMeasure abilities into a single Measure.Abstract class representing quality indicators.
Deprecated.
A
RandomGenerator aims to provide a random value of a given type.This class implements a random selection operator used for selecting randomly a solution from a list
Ranks a list of population according to the dominance relationship
This class implements a selection for selecting a number of solutions from
a solution list.
created at 10:29 pm, 2019/1/28 Comparator combining dominance-ranking comparator and DIR-score
comparator
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.
Created by antonio on 6/06/17.
Created by antonio on 6/06/17.
Created by antonio on 6/06/17.
Created by antonio on 6/06/17.
Created by antonio on 6/06/17.
This class implements a ring-based neighborhood.
This observer prints a chart in real time showing the current Pareto front approximation produced
by an algorithm.
This observer prints a chart in real time showing the current Pareto front approximation produced
by an algorithm.
This class allows to apply a SBX crossover operator using two parent solutions (Double encoding).
Scramble Mutation operator for permutation-based genetic algorithms.
Interface representing selection operators
Interface representing a sequence of values of the same type
Set coverage metric
SimpleDescribedEntity is a basic implementation of DescribedEntity.Simple Inversion Mutation operator for permutation-based genetic algorithms.
SimpleMeasure is a basic implementation of Measure.This
SimpleMeasureManager provides a basic implementation to manage a
collection of Measures.SimplePullMeasure is a basic implementation of PullMeasure.SimplePushMeasure is a basic implementation of PushMeasure.This class implements a random mutation operator for double solutions
This class implements a single point crossover operator.
Interface representing a Solution
Deprecated.
Created by Antonio J.
Class for finding the extreme values of a list of objects
Created by Antonio J.
This class implements the Spatial Spread Deviation density estimator
Compares two solutions according to the Spatial Spread Deviation attribute.
This class implements a density estimator based on the distance to the k-th nearest solution
Spatial Spread Deviation selection operator
This class implements the spread quality indicator.
This class implements the density estimator based on the distance to the k-th nearest solution
This class implements a solution list ranking based on the strength concept defined in SPEA2.
This utility reads a TSV file and generates another file in CSV format
Class defining a bi-dimensional mesh.
Created by FlapKap on 27-05-2017.
This class implements a uniform crossover operator for binary solutions.
This class implements a uniform mutation operator.
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.
This class implements a neighborhood based on the weight vectors of MOEA/D
This class implements the hypervolume indicator developed by the WFG
Deprecated.
This class allows to apply a whole arithmetic crossover operator to two parent solutions.
This observer stores a solution list in files.