All Classes and Interfaces
Class
Description
Abstract base implementation of a
TreeChromosome
.Abstract implementation of the
TreeGene
interface..Numeric chromosome implementation which holds arbitrary sized integer numbers.
Numeric chromosome implementation which holds an arbitrary sized integer
number.
The
ConcatEngine
lets you concatenate two (or more) evolution
Engine
, with different configurations, and let it
use as one engine EvolutionStreamable
.This
Spliterator
takes a list of other spliterators which are
concatenated and a limiting predicate.The
CyclicEngine
lets you concatenate two (or more) evolution
Engine
, with different configurations, and let it
use as one engine EvolutionStreamable
.Defines the order of two elements of a given vector type
V
.Defines the distance of two elements of a given vector type
V
.Tree specification, where the nodes of the whole tree are stored in an array.
Default implementation of the
FlatTree
interface.The Hybridizing PSM and RSM Operator (HPRM) constructs an offspring from a
pair of parents by hybridizing two mutation operators, PSM and RSM.
Resizable-int array implementation
Setup for a (μ, λ)-Evolution Strategy.
Collectors for collecting final pareto-set for multi-objective
optimization.
Setup for a (μ + λ)-Evolution Strategy.
This selector selects the first
count
elements of the population,
which has been sorted by the Crowded-Comparison Operator, as
described in
A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-IILow-level utility methods for doing pareto-optimal calculations.
This class only contains non-dominate (Pareto-optimal) elements according to
a given dominance measure.
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.
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.Swaps two, randomly chosen, nodes (sub-trees) from two given trees.
General purpose tree structure.
This class represents the path to child within a given tree.
Chromosome for tree shaped genes.
Abstract implementation of tree base crossover recombinator.
Definition of different tree formatter strategies.
Representation of tree shaped gene.
Implementation of a pattern based tree matcher.
The result of a tree match operation.
Abstract class for mutating tree chromosomes.
A general purpose node in a tree data-structure.
This class serves two purposes.
A sealed interface, which constitutes the nodes of a pattern tree.
This class represents a constant pattern value, which can be part of a
whole subtree.
Represents a placeholder (variable) for an arbitrary sub-tree.
This alterer uses a
TreeRewriter
for altering the TreeChromosome
.Interface for rewriting a given tree.
Represents a tree rewrite rule.
This class represents a Tree Rewrite System, which consists of a set of
Tree Rewrite Rules.
Unique fitness based tournament selection.
The
Vec
interface represents the fitness result of a multi-objective
fitness function.This interface allows creating vector object from a given array type
T
.Mutator implementation which is part of the
Weasel program
algorithm.
Configures the evolution engine to execute the
Weasel program
algorithm.
Selector implementation which is part of the
Weasel program
algorithm.