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.
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.
This Spliterator takes a list of other spliterators which are concatenated and a limiting predicate.
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.
 
Defines the order of two elements of a given vector type 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.
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.
Resizable-int array implementation
MLEvolutionStrategy<G extends Gene<?,G>,C extends Comparable<? super C>>
Setup for a (μ, λ)-Evolution Strategy.
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>>
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-II
Low-level utility methods for doing pareto-optimal calculations.
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 NumericGenes 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.
This class represents the path to child within a given tree.
Chromosome for tree shaped genes.
TreeCrossover<G extends TreeGene<?,G>,C extends Comparable<? super C>>
Abstract implementation of tree base crossover recombinator.
Definition of different tree formatter strategies.
TreeGene<A,G extends TreeGene<A,G>>
Representation of tree shaped gene.
Implementation of a pattern based tree matcher.
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.
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.
TreeRewriteAlterer<A,G extends TreeGene<A,G>,C extends Comparable<? super C>>
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.
UFTournamentSelector<G extends Gene<?,G>,C extends Comparable<? super C>>
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.
WeaselMutator<G extends Gene<?,G>,C extends Comparable<? super C>>
Mutator implementation which is part of the Weasel program algorithm.
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.