All Classes and Interfaces
Class
Description
This
AbstractArchive provides some common methods for Archive
s.Superclass for
GenericOperators.The
AbstractGenericOperator.OperatorClassPredicate returns true for a given
specific class.The
AbstractGenericOperator.OperatorPredicate interface.The
AbstractGenericOperator.OperatorVoidPredicate interface is used as marker for
Operators for which the predicate is not explicitly defined.The
AbstractIndividualFactory creates Individuals using a
given Provider and sets the registered
IndividualStateListeners.The
AbstractLogger triggers its refinement on specific events
dependent on the iteration and evaluation count.The
AbstractOptimizer is an abstract implementation of a
population-based Optimizer.The
AbstractSATDecoder can be used for the construction of custom SAT
Decoders.The
AdaptiveEpsilon contains the information about an ε-value and the
information that is used by the EpsilonAdaptation to adapt the
ε-value.The
AdaptiveGridArchive uses an adaptive grid in order to bound the
size of the Archive, see "Properties of an Adaptive Archiving
Algorithm for Storing Nondominated Vectors, J.Self adaptive
MutationRate that uses the size of the genotype (
size) to estimate a rate.The
AeSeHModule binds the EpsilonSamplingSelector as
Selector and the EpsilonNeighborhoodCoupler as
Coupler and configures them with the parameters used in the AeSeH
paper (see the citation for details).
The
Algebra operator.The
AlgebraDouble for DoubleGenotype.The
AlgebraGenericImplementation is a standard implementation of the
Algebra interface.The
ApplicationFrame.An
Archive is used to store a set of high-quality Individual
s.The
ArchiveModule determines an implementation for the Archive interface.Archive type.
A widget that monitors the archive.
The
BasicCrossoverModule.Type of
Crossover operator for the BooleanGenotype.Type of
Crossover operator for the DoubleGenotype.Type of
Crossover operator for the IntegerGenotype.Type of
Crossover operator for the PermutationGenotype.Type of
Diversity operator for the BooleanGenotype.Type of
Diversity operator for the DoubleGenotype.The
BasicMatingModule.CouplerType determines the coupler operator to use.The basic
CopyModule.Type of
Mutate operator for the DoubleGenotype.The type of the used mutation rate.
Type of
Mutate operator for the PermutationGenotype.The basic
NeighborModule.Type of
Neighbor operator for the PermutationGenotype.The
BinaryCopyDecoder passes the BinaryString directly to the
evaluator.The
BinaryString.The
Bits is used for the BinaryToDoubleDecoder.
The
BooleanGenotype consists of Boolean values that can be used as a
Genotype.An
Archive with bounded size.The
Category annotation marks a class as a category.The
Citation can be used in Opt4JModules to add citations to
scientific works.The
ClassPath is also known as the ClassPathHacker and
enables adding new files to the classpath.The
Configurator configures the modules and starts the specific
ApplicationFrame.The
Constant is an annotation for injected constant values.The
ConstantCrossoverRate represents a crossover rate that is
constant during the whole optimization.Constant mutation rate.
A linear pseudo-Boolean
Constraint as used in an Integer Linear
Program (ILP).The
Constraint.Operators correspond to the Boolean operators <=,=,>=.The
ContentPanel abstract class.Thrown if a contradiction is recognized.
The
Control allows to pause, stop, and terminate, the optimization
process.The
Control.State of the control.
The
ControlButtons contains JButtons for the controls:The
ControlListener is an interface of classes that listen to the
Control state.The
ControlToolBarService is a ToolBarService that allows to
Control the Optimizer.This service has an
ToolBarOrder with -100.The
ConvergencePlotWidget plots the convergence for each
Objective.The
CoolingSchedule for the SimulatedAnnealing.The default cooling schedule is the
CoolingScheduleLinear.Abstract class for modules that bind to the
CoolingSchedule
interface.This module provides several common
CoolingSchedules for the
SimulatedAnnealing.Type of
CoolingSchedule to use.Operator that creates copies of a
Genotype.Implementation of the
Copy interface.The
CopyModule is used for modules for the Copy operator.The
Coupler determines couples that are used to create the offspring
for a given set of possible parents.The
CouplerDefault uses the pairs based on their index in the list:
p0+p1,p2+p3,etc..Binds the
CouplerDefault as the Coupler.Abstract module class for the
Coupler.The
CouplerRandom uses the set of parents and creates couples
randomly from this set.Binds the
CouplerRandom as the Coupler.The
CouplerUnique uses the set of parents and creates couples
randomly from this set.Binds the
CouplerUnique as the Coupler.Crossover operator that performs a crossover for two parents.
Interface for
Crossover operator for BooleanGenotype.The default crossover operator for the binary vector is the
CrossoverBooleanRate with 0.5 rate.Crossover for the
BooleanGenotype.Crossover for the
BooleanGenotype.Crossover for the
DoubleGenotype.The
CrossoverDoubleBLX is an implementation of the blend crossover
operator proposed by Eshelman and Schaffer, 1993.The
CrossoverDoubleElementwise can be used to derive
CrossoverDouble classOperators that can work element-wise on the
double vectors.The
CrossoverDoubleSBX is an implementation of the simulated binary
crossover operator proposed by Deb and Kumar, 1995.The
CrossoverDoubleUnfairAverage implements the unfair average
crossover proposed by Nomura and Miyhoshi, 1996.Implementation of the
Crossover interface.The
CrossoverInteger is the interface for the IntegerGenotype
.
The
CrossoverListRate performs a crossover on
Genotype objects that are lists of values.
The
CrossoverListXPoint performs a crossover on
Genotype objects that are lists of values.The
CrossoverModule is used for modules for the Crossover
operator.Interface for the
Crossover operator for the
PermutationGenotype.
Crossover for the
PermutationGenotype.Crossover for the
PermutationGenotype.
Crossover for the
PermutationGenotype.The
CrossoverRate is an interface for the crossover rate which is the
probability of two individuals undergoing crossover.The
Crowding, see "A fast and elitist multiobjective genetic
algorithm : NSGA-II, K.The
CrowdingArchive is based on the Crowding distance.The
DefaultAbout panel.The
DefaultContentPanel.The
DefaultIndividualFactory is a creator for standard
Individuals.The
DefaultModulesPanel.The
DefaultSelectedPanel.The default SAT/PB solver is the
SAT4JSolver with timeout 3600
seconds, fixed length learning with learning size 10, and MiniSAT restarts.The
DelayTask executes tasks immediately or delayed if they arrive
too close (delay).The
Div divides two terms.The
Diversity determines the genetic diversity of two
Individuals.The
DiversityBooleanFraction calculates the Diversity between
two BooleanGenotypes by calculating the fraction of different vector
entries.The
DiversityDoubleAbsolute calculates the Diversity as the
mean absolute difference of each entry in the double vector.The
DiversityDoubleEuclidean calculates the Diversity by the
Euclidean distance between the two Genotypes.The
DiversityGenericImplementation is a standard implementation of
the Diversity interface.The
DiversityIntegerEuclidean is an implementation of the
DiversityInteger that calculates the diversity of two
IntegerGenotype objects by normalizing the values to [0,1]
and calculating the Euclidean distance.The
DiversityModule is used for modules for the Diversity
operator.The
DoubleBounds is an implementation of the Bounds for the
DoubleGenotype that accepts arrays as well as lists as bounds.The
DoubleCopyDecoder passes the DoubleString directly to the
evaluator.
The
DoubleGenotype consists of double values that can be used as a
Genotype.The
DoubleString.The
DTLZ1 function.The
DTLZ2 function.The
DTLZ3 function.The
DTLZ4 function.The
DTLZ5 function.The
DTLZ6 function.The
DTLZ7 function.Module for the DTLZ benchmarks as proposed in Deb et al.
The used encoding type.
The used DTZL1 function.
The
ElitismSelector is a single objective elitism select.The
ElitismSelectorModule is the module that binds the
ElitismSelector.The
EpsilonAdaptation manages the adaptation of the ε-value stored in
the AdaptiveEpsilon.The
EpsilonAdaptationDelta adapts the ε values exactly as described
in the paper cited in the AeSeHModule.The
EpsilonMapping implements the ε mapping used by the
EpsilonSamplingSelector.The
EpsilonMappingAdditive implements the evenly spaced adaptive ε
function.The
EpsilonNeighborhoodCoupler implements a parent selection process
based on by the ε-neighborhood.Binds the
EpsilonNeighborhoodCoupler as the Coupler.The
EpsilonSamplingSelector implements a selection process based on
the ε-sampling.Binds the
EpsilonSamplingSelector as Selector.The
ESamplingSurvivorGeneration generates the survivor pool during
the selection implemented by EpsilonSamplingSelector.The
ESamplingSurvivorGenerationBasic implements the basic survivor
selection used by the Adaptive ε-sampling and ε-hood for evolutionary
many-objective optimization.The
Evaluator evaluates phenotypes to Objectives.The
EvolutionaryAlgorithm is an implementation of an Evolutionary
Algorithm based on the operators Crossover and Mutate.The
EvolutionaryAlgorithmModule configures the
EvolutionaryAlgorithm.The
EvolutionaryAlgorithmModule.CrossoverRateType allows to choose between different types of
crossover rates.The
ExecutionEnvironment for Tasks.The
FileChooser.The
FileOperations.The
Format contains several format rules.The
FrontDensityIndicator is an interface for the determination of
density values of a front of Individuals.The
GenericOperator is an interface for generic operators.The
Genotype represents a marker interface.The
Hypervolume, see "Zitzler, E., and Thiele, L.The
Icon annotation assigns an icon to modules.The
Ignore annotation can either be used for modules or properties
such that these are ignored in the
Configurator.
The
Individual class forms a single solution for the given
optimization problem.The possible states of an
Individual.An
IndividualCompleter completes the evaluation process of
Individuals.The
IndividualCompleterModule is used to choose and configure a
IndividualCompleter.The
IndividualCompleterModule.Type of IndividualCompleter to use.The
IndividualFactory is a creator for Individuals.Listener for mouse events on
Individuals.The
IndividualSetListener receives notifications if an
Individual is added to or removed from an IndividualSet.The
Info annotation contains textual information about a module or
property.The
IntegerBounds is an implementation of the Bounds for the
IntegerGenotype that accepts arrays as well as lists for as bounds.An item.
The set of selected items.
The
Iteration object is used as iteration counter for the
optimization.
This
IterativeOptimizer interface has to be implemented by all
population-based iterative optimizers.Wrapper for
Node elements.The
K is a binding annotation.A knapsack has a given capacity.
The
KnapsackBinaryCreatorDecoder creates and decodes the given
KnapsackProblemRandom using one bit per item, i.e.The multiobjective 0/1 ILP knapsack problem as proposed in Zitzler and Thiele
1999.
The
KnapsackOverloadEvaluator evaluates a given ItemSelection
using one Objective to sum up all knapsack overloads and one
Objective for the profit of each knapsack.The
KnapsackProblem defines the basic problem, i.e., the collection
of Item and Knapsack elements, respectively.The
KnapsackProblemFile is a KnapsackProblem that is
initialized by a file.The
KnapsackProblemRandom, see "E.The
KnapsackProfitEvaluator evaluates a given ItemSelection
using one Objective to sum up all knapsack overloads and one
Objective for the profit of each knapsack.Use SAT decoding to solve knapsack problem.
A
Literal is a data structure that represents a variable and its
phase.The
Logger is a marker interface for logging classes.Module for logging.
The
LOTZCreator.The
LOTZDecoder.The
LOTZEvaluator.
The
LOTZModule for the "Leading Ones Trailing Zeros" optimization
problem.The
M is an annotation for integer values that define the number of
objective functions (the dimension of the objective space).The
Mating interface is used to create offspring from a given set of
parents.The
MatingCrossoverMutate creates offspring from a given set of
parents by using Crossover and Mutate.The
MaxIterations is the default binding annotation for the maximal
number of iterations for an Optimizer.The
Menu.The
MixedSATManager encodes the decision strategy into two vectors:
One binary vector for the phase and one double vector for the priority.The
Model is a data structure that represents a solution of the given
problem, i.e., all Literals are set such that all Constraints
specified by the AbstractSATDecoder are feasible.The
ModuleAutoFinder searches the classpath for all
PropertyModules that are not annotated with Ignore.The
ModuleAutoFinderListener is a listener interface for the
ModuleAutoFinder.The
ModuleListUser is a ModuleList for user defined modules.Helper class for loading
PropertyModule configurations from files or
retrieving these from XML Nodes.The
ModuleRegister contains all found modules for the
Configurator.Helper class for saving the
PropertyModule configurations or adding
these to XML Nodes.The
ModulesPanel.The
MOPSO is an implementation of a multi-objective particle swarm
optimizer, see "Improving PSO-based Multi-Objective Optimization using
Crowding, Mutation and e-Dominance, M.The
MOPSOModule for the MOPSO optimizer.The
MultiEvaluator takes all registered Evaluators and uses
them to evaluate the phenotype.Mutate for the
BooleanGenotype.Mutate for the
DoubleGenotype.The
MutateDoubleGauss.The
MutateDoubleNonUniform non-uniformly mutates a
DoubleGenotype elementwise.The
MutateDoubleUniform uniformly mutates a DoubleGenotype
elementwise.Implementation of the
Mutate interface.The
MutateInteger is the interface for {link Mutate} operators for
IntegerGenotype objects.The
MutateIntegerRandom mutates each element of the
IntegerGenotype with the mutation rate.The
MutateModule is used for modules for the Mutate operator.
Interface for the
Mutate operator for the PermutationGenotype
.
Mutate for the
PermutationGenotype.
Mutate for the
PermutationGenotype.
Mutate for the
PermutationGenotype.
Mutate operator for the
PermutationGenotype.Interface for the
MutationRate.The
N is an annotation for integer values that define the size of the
search space.The
Name annotation assigns a user defined name to a module or
property.The
Neighbor operator as it is used for Simulated Annealing.The
DiversityBoolean operator for the BooleanGenotype.The
NeighborDouble operator for the DoubleGenotype.Implementation of the
Neighbor interface.The
NeighborhoodScheduler manages the schedule according to which the
neighborhoods are chosen by the EpsilonNeighborhoodCoupler to pick the crossover
parents.The
NeighborhoodSchedulerRoundRobin schedules the neighborhoods in a simple
round-robin fashion.The
NeighborIntegerRandom selects on element of an
IntegerGenotype and changes it.The
NeighborModule is used for modules for the Neighbor
operator.Interface for the
Neighbor operator for the
PermutationGenotype.
Neighbor for the
PermutationGenotype.
Randomly selects between
NeighborPermutationSwap,
NeighborPermutationInsert, and NeighborPermutationRevert.
Neighbor for the
PermutationGenotype.
Neighbor operator for the
PermutationGenotype.The
NonDominatedFronts sorts each evaluated Individual into
fronts based on the number of other individuals it is dominated by.The
NormalizeDoubleBorder normalizes the DoubleGenotype by
setting the values to the borders if the bounds are violated.
The
NormalizeDoubleElementwise normalizes DoubleGenotypes
elementwise.The
NormalizeDoubleMirror normalizes the DoubleGenotype by
mirroring the values on the borders if the bounds are violated.The
NormalizeDoubleWrap normalizes the DoubleGenotype by
wrapping the values at the borders.
The
Objective is the identifier for a single objective in the
Objectives.The sign of the
Objective.The
ObjectivesMonitor informs its listeners about the
Objectives of the optimization problem as soon as it is available.The
ObjectivesMonitor.ObjectivesListener is an interface for classes that need the
objectives.The
Operator is the basic interface for all operators.Module class for an
Operator.The
Opt4J configuration GUI.The
Opt4JAbout information.The
Opt4JModule is the superclass for all modules.The
Opt4JStarter starts configuration files directly without the
configurator (GUI).The
Opt4JTask executes one optimization process.The
Opt4JTasksPanel extends the DefaultTasksPanel by
additional functionality: Additional control and extended state.The
OptimizationMediator performs the overall optimization process
for the IterativeOptimizer.
This
Optimizer interface has to be implemented by all
population-based optimizers.The
OptimizerIterationListener is used to monitor the iteration of
the Optimizer.Abstract module class for the
Optimizer modules.The
OptimizerStateListener is used to monitor the state of the
Optimizer.The
Order annotation assigns a user defined order to properties of a
module.The abstract
Order is the base class for a decision strategy.The
OutputModule.The
Pair groups two objects of the same type in a given order.The
Panel annotation allows the definition of a custom panel for a
module.The
ParallelIndividualCompleter completes Individuals with
multiple threads.The
Parameters is a class for the identification of types/classes of
a generic parameter.The
Parent annotation assigns a module an explicit parent category.The
Particle extends the Individual by an id, a velocity
Genotype, a personal best Genotype and the corresponding best
Objectives.The
ParticleFactory.
The
PermutationGenotype can be used as a Genotype.The
PooledSolver is a decorator that enables pooling of
Solver instances and, therefore, a parallel execution of the
Solvers.The
Population manages a set of Individuals.A widget that monitors the
Population.The
ProblemModule is an abstract module class for the binding of the
Creator, Decoder, and Evaluator.The
Property contains information about a single property of a
PropertyModule.The
PropertyModule is a decorator for a Module that enables
property methods.The
PropertyPanel is a panel for the configuration of one module.A
QueensBoard represents a chessboard with a given side length on
which with queens can be placed.A simple decoder strategy.
The evaluator for the
QueensProblem.The evaluator for the
QueensProblem.The
QueensModule is used for the configuration of the queens problem.The
Decoder strategy for the queens problem.A permutation decoder strategy.
The
QueensProblem information.A SAT decoder strategy.
The
Rand class is an abstract class that is utilized as an interface
for random classes.The
RandomJava is the default java Random.The
RandomMersenneTwister uses an implementation of the mersenne
twister random number generator written by David Beaumont.The
RandomModule is used to configure the used random number
generator.The
RandomSearch simply generates random Individuals and
evaluates them.The
RandomSearchModule.The
Required annotation defines dependencies between the properties.The
Requirement indicates if a Property is active or not.The
SAT4JModule enables and configures the SAT4JSolver.The
SAT4JSolver implements a Solver.Specialized
Genotype for the AbstractSATDecoder.Module class for a SAT-
Solver.The
SelectedModules.The
ContentPanel.
The
SelectGenotype selects for each index an element from the given
list.
The
SelectMapGenotype selects for each key an element from a given
list.The interface
Selector is used to select a certain subset of
Individuals from a Population by respecting certain metrics
like their fitness.The default selector is the
Nsga2 selector with the
tournament value 0.Abstract module class for the
Selector.
The
SequentialIndividualCompleter completes the Individuals
sequentially.The
SetListener.The
SimulatedAnnealing is a standard implementation of the
optimization heuristic.This module binds the
SimulatedAnnealing optimizer.Module for the S-Metric Selection (
Selector) based on the Hypervolume contribution, see Emmerich et
al.The
Solver is an interface for SAT/PB solvers.
The
Spea2-Selector is a Java implementation of the
SPEA2-MOEA, see "SPEA2: Improving the Strength Pareto Evolutionary
Algorithm For Multiobjective Optimization, Eckart Zitzler, Marco Laumanns,
and Lothar Thiele, In Evolutionary Methods for Design, Optimisation, and
Control, pages 19–26, 2002.".The
Spea2Module configures the Spea2 selector.The
Starter executes configuration files.The
Startupable interface.The
StatusBar contains informations about the optimization progress
and time per iteration.The
StopException is thrown if the optimization is stopped.The
Task is an abstract class for optimization tasks.The
Task.State of a task.The
TaskListener.The
TasksPanel abstract class.The
TaskStateListener.The
Term interface.The
Term is an element of the linear Constraint.The
TerminationException is thrown if the optimization is terminated.Thrown if the solver can not solve the problem within a given time bound.
The
ToolBar.The
ToolBar is a collection of the ToolBarServices.The
ToolBarOrder Annotation is used for ToolBarService
ordering.The
ToolBarService is an interface for arbitrary components that are
added to the tool bar in the viewer.The
Transformer design pattern.The
UnboundedArchive is an Archive with unbounded size.The
Var returns a double value.A
VariableOrder implementation for the SAT4J interface.The
VelocityTerm is used to determine the new velocity of a
Particle.The
Viewer.The
Viewer.CloseEvent that is triggered if this viewer is closed.The
ViewerModule configures the optimization process viewer.The
VisualizationModule.The
WFG1 benchmark function.The
WFG2 benchmark function.The
WFG3 benchmark function.The
WFG4 benchmark function.The
WFG4 benchmark function.The
WFG6 benchmark function.The
WFG7 benchmark function.The
WFG8 benchmark function.The
WFG8 benchmark function.The
WFGEvaluator.The
WFGI1 benchmark function.The
WFGI2 benchmark function.The
WFGI3 benchmark function.The
WFGI4 benchmark function.The
WFGI5 benchmark function.Module for the WFG (Walking Fish Group) benchmarks, see Huband et al.
The used encoding type.
The used WFG function.
The
WidgetParameters.Function ZDT 1.
Function ZDT 2.
Function ZDT 3.
Function ZDT 4.
Function ZDT 5.
The
ZDT5BinaryCreator for the ZDT5 problem.Function ZDT 6.
The
ZDTModule configures the ZDT benchmarks, see Zitzler et al.The used encoding type.
The used ZDT function.