All Classes and Interfaces
Class
Description
Evolutionary Algorithm Configuration.
Evolutionary Algorithm - Execution Context
TODO TEST THE SHIT OUT OF ME
A chromosome implementation that represents genetic information as a sequence of bits.
Base interface for all chromosome types in the genetic algorithm framework.
Factory interface for creating chromosome instances based on specifications.
Marker interface for chromosome specifications in evolutionary algorithms.
A simple default evolution listener that outputs progress to System.out without requiring external logging
dependencies.
Delete N Last
A chromosome implementation that represents genetic information as an array of double-precision floating-point
values.
Evolutionary Algorithm Configuration.
Evolutionary Algorithm Configuration.
Evolutionary Algorithm - Execution Context
Defines multiple factory and helper methods to create and manage EAExecutionContexts
Main orchestrator class for evolutionary algorithms, managing the complete evolution process.
Factory class providing convenient methods for creating properly configured
EASystem instances.Specify an elitism based replacement strategy
Functional interface for monitoring and responding to evolution progress during genetic algorithm execution.
Evolution listener that logs the top N individuals from each generation.
Functional interface for evaluating the fitness of a genotype in an evolutionary algorithm.
Functional interface for asynchronous batch fitness evaluation in evolutionary algorithms.
Facade interface for abstracting different fitness evaluation strategies in evolutionary algorithms.
Wrapper around
FitnessBulkAsync for computing the fitness of a populationWrapper around
Fitness for computing the fitness of a populationVirtual thread-based fitness evaluator that creates one virtual thread per individual evaluation.
A chromosome implementation that represents genetic information as an array of single-precision floating-point
values.
Generational Replacement strategy
Represents a genotype in an evolutionary algorithm, which is a collection of chromosomes.
Pair of Genotype to its associated fitness
Utility class for generating initial populations of genotypes in evolutionary algorithms.
Immutable implementation of
BitChromosomeSpec.Builds instances of type
BitChromosomeSpec.Immutable implementation of
ChromosomeFactoryProvider.Builds instances of type
ChromosomeFactoryProvider.Immutable implementation of
CreepMutation.Builds instances of type
CreepMutation.Immutable implementation of
DeleteNLast.Builds instances of type
DeleteNLast.Immutable implementation of
DoubleChromosomeSpec.Builds instances of type
DoubleChromosomeSpec.Immutable implementation of
EAConfiguration.Builds instances of type
EAConfiguration.Immutable implementation of
EAConfigurationBulkAsync.Builds instances of type
EAConfigurationBulkAsync.Immutable implementation of
EAExecutionContext.Builds instances of type
EAExecutionContext.Immutable implementation of
Elitism.Builds instances of type
Elitism.Immutable implementation of
EvolutionResult.Builds instances of type
EvolutionResult.Immutable implementation of
FitnessSharing.Builds instances of type
FitnessSharing.Immutable implementation of
FloatChromosomeSpec.Builds instances of type
FloatChromosomeSpec.Immutable implementation of
GenerationalReplacement.Builds instances of type
GenerationalReplacement.Immutable implementation of
GenotypeFitness.Builds instances of type
GenotypeFitness.Immutable implementation of
Individual.Builds instances of type
Individual.Immutable implementation of
IntChromosomeSpec.Builds instances of type
IntChromosomeSpec.Immutable implementation of
MultiCombinations.Builds instances of type
MultiCombinations.Immutable implementation of
MultiMutations.Builds instances of type
MultiMutations.Immutable implementation of
MultiPointArithmetic.Builds instances of type
MultiPointArithmetic.Immutable implementation of
MultiPointCrossover.Builds instances of type
MultiPointCrossover.Immutable implementation of
MultiSelections.Builds instances of type
MultiSelections.Immutable implementation of
MultiTournaments.Builds instances of type
MultiTournaments.Immutable implementation of
NormalDistribution.Builds instances of type
NormalDistribution.Immutable implementation of
OrderCrossover.Builds instances of type
OrderCrossover.Immutable implementation of
PartialMutation.Builds instances of type
PartialMutation.Immutable implementation of
PickFirstParent.Builds instances of type
PickFirstParent.Immutable implementation of
ProportionalTournament.Builds instances of type
ProportionalTournament.Immutable implementation of
RandomMutation.Builds instances of type
RandomMutation.Immutable implementation of
RandomSelection.Builds instances of type
RandomSelection.Immutable implementation of
RouletteWheel.Builds instances of type
RouletteWheel.Immutable implementation of
SelectAll.Builds instances of type
SelectAll.Immutable implementation of
SelectiveRefinementTournament.Builds instances of type
SelectiveRefinementTournament.Immutable implementation of
SinglePointArithmetic.Builds instances of type
SinglePointArithmetic.Immutable implementation of
SinglePointCrossover.Builds instances of type
SinglePointCrossover.Immutable implementation of
SwapMutation.Builds instances of type
SwapMutation.Immutable implementation of
Tournament.Builds instances of type
Tournament.Immutable implementation of
UniformDistribution.Builds instances of type
UniformDistribution.Represents an individual in an evolutionary algorithm, consisting of a genotype and its associated fitness value.
A chromosome implementation that represents genetic information as an array of integer values.
Specification for integer array chromosomes in evolutionary algorithms.
Select uniformly a mutation policy among a list
Marker interface for mutation policy specifications in evolutionary algorithms.
Functional interface for applying mutation operations to genotypes in evolutionary algorithms.
Specify the goal, whether to minimize or maximize the fitness score
Represents a population of individuals in an evolutionary algorithm.
Iterator implementation for traversing individuals in a population during evolutionary algorithms.
Marker interface for replacement strategy specifications in evolutionary algorithms.
Marker interface for selection policy specifications in evolutionary algorithms.
Selective Refinement Tournament selection strategy that enhances traditional tournament selection by applying an
additional refinement step to a subset of candidates.
Builder class for constructing SelectiveRefinementTournament instances.
Functional interface for selecting individuals from a population in evolutionary algorithms.
Functional interface for determining when to stop the evolutionary algorithm.
Utility class providing factory methods for creating common termination conditions in evolutionary algorithms.
A chromosome implementation that represents genetic information as a tree structure.
Represents a node in a tree structure used for genetic programming and tree-based chromosomes.