All Classes Interface Summary Class Summary
Class |
Description |
AbstractTreeChromosome<A,G extends AbstractTreeGene<A,G>> |
Abstract base implementation of a TreeChromosome .
|
AbstractTreeGene<A,G extends AbstractTreeGene<A,G>> |
Abstract implementation of the TreeGene interface..
|
BigIntegerChromosome |
Numeric chromosome implementation which holds arbitrary sized integer numbers.
|
BigIntegerGene |
Numeric chromosome implementation which holds an arbitrary sized integer
number.
|
ConcatEngine<G extends Gene<?,G>,C extends Comparable<? super C>> |
The ConcatEngine lets you concatenate two (or more) evolution
Engine , with different configurations, and let it
use as one engine EvolutionStreamable .
|
CyclicEngine<G extends Gene<?,G>,C extends Comparable<? super C>> |
The CyclicEngine lets you concatenate two (or more) evolution
Engine , with different configurations, and let it
use as one engine EvolutionStreamable .
|
ElementComparator<V> |
Defines the order of two elements of a given vector type V .
|
ElementDistance<V> |
Defines the distance of two elements of a given vector type V .
|
FlatTree<V,T extends FlatTree<V,T>> |
Tree specification, where the nodes of the whole tree are stored in an array.
|
FlatTreeNode<V> |
Default implementation of the FlatTree interface.
|
HPRMutator<G extends Gene<?,G>,C extends Comparable<? super C>> |
The Hybridizing PSM and RSM Operator (HPRM) constructs an offspring from a
pair of parents by hybridizing two mutation operators, PSM and RSM.
|
MLEvolutionStrategy<G extends Gene<?,G>,C extends Comparable<? super C>> |
Setup for a (μ, λ)-Evolution Strategy.
|
MOEA |
Collectors for collecting final pareto-set for multi-objective
optimization.
|
MpLEvolutionStrategy<G extends Gene<?,G>,C extends Comparable<? super C>> |
Setup for a (μ + λ)-Evolution Strategy.
|
NSGA2Selector<G extends Gene<?,G>,C extends Comparable<? super C>> |
|
Pareto |
Low-level utility methods for doing pareto-optimal calculations.
|
ParetoFront<T> |
This class only contains non-dominate (Pareto-optimal) elements according to
a given dominance measure.
|
RSMutator<G extends Gene<?,G>,C extends Comparable<? super C>> |
The reverse sequence mutation, two positions i and j are randomly chosen The
gene order in a chromosome will then be reversed between this two points.
|
SimulatedBinaryCrossover<G extends NumericGene<?,G>,C extends Comparable<? super C>> |
Performs the simulated binary crossover (SBX) on a Chromosome of
NumericGene s such that each position is either crossed contracted or
expanded with a certain probability.
|
SingleNodeCrossover<G extends TreeGene<?,G>,C extends Comparable<? super C>> |
Swaps two, randomly chosen, nodes (sub-trees) from two given trees.
|
Tree<V,T extends Tree<V,T>> |
General purpose tree structure.
|
Tree.Path |
This class represents the path to child within a given tree.
|
TreeChromosome<A,G extends TreeGene<A,G>> |
Chromosome for tree shaped genes.
|
TreeCrossover<G extends TreeGene<?,G>,C extends Comparable<? super C>> |
Abstract implementation of tree base crossover recombinator.
|
TreeFormatter |
Definition of different tree formatter strategies.
|
TreeGene<A,G extends TreeGene<A,G>> |
Representation of tree shaped gene.
|
TreeMatcher<V> |
Implementation of a pattern based tree matcher.
|
TreeMatchResult<V> |
The result of a tree match operation.
|
TreeMutator<A,G extends TreeGene<A,G>,C extends Comparable<? super C>> |
Abstract class for mutating tree chromosomes.
|
TreeNode<T> |
A general purpose node in a tree data-structure.
|
TreePattern<V> |
This class serves two purposes.
|
TreePattern.Decl<V> |
A sealed class, which constitutes the nodes of a pattern tree.
|
TreePattern.Val<V> |
This class represents a constant pattern value, which can be part of a
whole sub-tree.
|
TreePattern.Var<V> |
Represents a placeholder (variable) for an arbitrary sub-tree.
|
TreeRewriteAlterer<A,G extends TreeGene<A,G>,C extends Comparable<? super C>> |
|
TreeRewriter<V> |
Interface for rewriting a given tree.
|
TreeRewriteRule<V> |
Represents a tree rewrite rule.
|
TRS<V> |
This class represents a Tree Rewrite System, which consists of a set of
Tree Rewrite Rules.
|
UFTournamentSelector<G extends Gene<?,G>,C extends Comparable<? super C>> |
Unique fitness based tournament selection.
|
Vec<T> |
The Vec interface represents the fitness result of a multi-objective
fitness function.
|
VecFactory<T> |
This interface allows to create vector object from a given array type
T .
|
WeaselMutator<G extends Gene<?,G>,C extends Comparable<? super C>> |
|
WeaselProgram<G extends Gene<?,G>,C extends Comparable<? super C>> |
Configures the evolution engine to execute the
Weasel program
algorithm.
|
WeaselSelector<G extends Gene<?,G>,C extends Comparable<? super C>> |
Selector implementation which is part of the
Weasel program
algorithm.
|