All Classes Interface Summary Class Summary Exception Summary
| Class |
Description |
| AbortControl |
A GUI control that allows the user to abort an evolutionary program.
|
| AbstractCandidateFactory<T> |
|
| AbstractCrossover<T> |
Generic base class for cross-over implementations.
|
| AbstractEvolutionEngine<T> |
|
| BitStringCrossover |
Cross-over with a configurable number of points (fixed or random) for
bit strings.
|
| BitStringFactory |
General purpose candidate factory for generating bit strings for
genetic algorithms.
|
| BitStringMutation |
Mutation of individual bits in a BitString according to some
probability. |
| ByteArrayCrossover |
Cross-over with a configurable number of points (fixed or random) for
arrays of primitive bytes.
|
| CachingFitnessEvaluator<T> |
|
| CandidateFactory<T> |
Creates new populations of candidates.
|
| CharArrayCrossover |
Cross-over with a configurable number of points (fixed or random) for
arrays of primitive chars.
|
| CompositeIDSource |
Thread-safe source for partitioned unique IDs.
|
| ConfigurableLineBorder |
Border class that allows each of the four sides of the border to be enabled
or disabled independently.
|
| ConfigurableThreadFactory |
|
| Console<T> |
A console provides users with a mechanism for interacting with an
evolutionary algorithm.
|
| DoubleArrayCrossover |
Cross-over with a configurable number of points (fixed or random) for
arrays of primitive doubles.
|
| ElapsedTime |
Terminates evolution after a pre-determined period of time has elapsed.
|
| EvaluatedCandidate<T> |
Immutable wrapper class for associating a candidate solution with its
fitness score.
|
| EvolutionaryOperator<T> |
An evolutionary operator is a function that takes a population of
candidates as an argument and returns a new population that is the
result of applying a transformation to the original population.
|
| EvolutionControl |
Common interface for GUI controls for evolutionary programs.
|
| EvolutionEngine<T> |
Operations for classes that provide an evolution implementation.
|
| EvolutionMonitor<T> |
The Evolution Monitor is a component that can be attached to an
EvolutionEngine to provide
real-time information (in a Swing GUI) about the current state of the
evolution. |
| EvolutionObserver<T> |
Call-back interface so that programs can monitor the state of a
long-running evolutionary algorithm.
|
| EvolutionPipeline<T> |
A compound evolutionary operator that applies multiple operators (of the
same type) in series.
|
| EvolutionStrategyEngine<T> |
General purpose engine for implementing Evolution Strategies.
|
| EvolutionUtils |
Utility methods used by different evolution implementations.
|
| FitnessEvaluationWorker |
This is the class that actually runs the fitness evaluation tasks created by a
EvolutionEngine. |
| FitnessEvaluator<T> |
Calculates the fitness score of a given candidate of the appropriate type.
|
| GenerationalEvolutionEngine<T> |
This class implements a general-purpose generational evolutionary algorithm.
|
| GenerationCount |
Terminates evolution after a set number of generations have passed.
|
| IdentityOperator<T> |
Evolutionary operator that simply returns the selected candidates unaltered.
|
| IDSource<T extends Serializable> |
Defines operations for classes that generate unique identifiers.
|
| IDSourceExhaustedException |
Unchecked exception thrown if an IDSource runs out of unique IDs. |
| IntArrayCrossover |
Cross-over with a configurable number of points (fixed or random) for
arrays of primitive ints.
|
| InteractiveSelection<T> |
Special selection strategy used for interactive evolutionary algorithms.
|
| IntSequenceIDSource |
Thread-safe source for unique IDs.
|
| IslandEvolution<T> |
An implementation of island evolution in which multiple independent populations are evolved in
parallel with periodic migration of individuals between islands.
|
| IslandEvolutionObserver<T> |
A specialisation of EvolutionObserver that, as well as
receiving global population updates (at the end of each epoch), can receive individual island
population updates (at the end of each generation on each island). |
| ListCrossover<T> |
Variable-point (fixed or random) cross-over for arbitrary lists.
|
| ListInversion<T> |
An evolutionary operator that randomly reverses a subsection of a list.
|
| ListOperator<T> |
A higher-order evolutionary operator that is applied to populations made
up of lists.
|
| ListOrderCrossover<T> |
Implements ordered cross-over between arbitrary lists.
|
| ListOrderMutation<T> |
A special mutation implementation that instead of changing the
genes of the candidate, re-orders them.
|
| ListPermutationFactory<T> |
Generates random candidates from a set of elements.
|
| LongSequenceIDSource |
Thread-safe source for unique IDs.
|
| Migration |
Strategy interface for different ways of migrating individuals between islands
in IslandEvolution. |
| NumericParameterControl<T extends Number & Comparable<T>> |
A GUI control that allows the user to set/update the value of a
numeric parameter.
|
| ObjectArrayCrossover<T> |
Cross-over with a configurable number of points (fixed or random) for
arrays of reference types.
|
| ObjectArrayPermutationFactory<T> |
Generates random candidates from a set of elements.
|
| ObjectSwingRenderer |
A default Renderer implementation that can display any object
as a Swing component. |
| PopulationData<T> |
Immutable data object containing statistics about the state of
an evolved population and a reference to the fittest candidate
solution in the population.
|
| ProbabilityParameterControl |
A GUI control that allows the user to set/update the value of a
Probability parameter. |
| RankSelection |
A selection strategy that is similar to fitness-proportionate selection
except that is uses relative fitness rather than absolute fitness in order to
determine the probability of selection for a given individual (i.e.
|
| ReflectionUtils |
Helper methods to simplify code that uses reflection.
|
| Renderer<T,S> |
Maps objects of one type to objects of a different type.
|
| RendererAdapter<T,S> |
Adapter class for chaining together two renderers in series to provide
flexibility.
|
| Replacement<T> |
An evolutionary operator that replaces individuals with randomly-generated
new individuals, according to some specified probability.
|
| RingMigration |
Migrates a fixed number of individuals from each island to the adjacent island.
|
| RouletteWheelSelection |
Implements selection of n candidates from a population by selecting
n candidates at random where the probability of each candidate getting
selected is proportional to its fitness score.
|
| SelectionStrategy<T> |
Strategy interface for "natural" selection.
|
| SelectionStrategyControl<T> |
An evolution control for selecting between different SelectionStrategy implementations. |
| SigmaScaling |
|
| SplitEvolution<T> |
Compound evolutionary operator that allows the evolution of a population
to be split into two separate streams.
|
| SpringUtilities |
Utility methods for creating form-style or grid-style layouts with SpringLayout.
|
| Stagnation |
A TerminationCondition that halts evolution if no improvement in fitness
is observed within a specified number of generations. |
| StatusBar |
Status bar component for the evolution monitor.
|
| SteadyStateEvolutionEngine<T> |
An implementation of steady-state evolution, which is a type of evolutionary algorithm
where a population is changed incrementally, with one individual evolved at a time.
|
| StochasticUniversalSampling |
|
| StringCrossover |
Variable-point (fixed or random) cross-over for String candidates.
|
| StringFactory |
General-purpose candidate factory for EAs that use a fixed-length String encoding.
|
| StringMutation |
Mutation of individual characters in a string according to some
probability.
|
| StringPrefixIDSource |
Thread-safe ID source that wraps another source of IDs and adds a fixed String
prefix to each ID generated.
|
| SwingBackgroundTask<V> |
A task that is executed on a background thread and then updates
a Swing GUI.
|
| SwingConsole |
Swing-based console for interactive evolutionary algorithms.
|
| TargetFitness |
Terminates evolution once at least one candidate in the population has equalled
or bettered a pre-determined fitness score.
|
| TerminationCondition |
Interface for implementing conditions used to terminate evolutionary algorithms.
|
| TournamentSelection |
Selection strategy that picks a pair of candidates at random and then
selects the fitter of the two candidates with probability p, where p
is the configured selection probability (therefore the probability of
the less fit candidate being selected is 1 - p).
|
| TruncationSelection |
Implements selection of n candidates from a population by simply
selecting the n candidates with the highest fitness scores (the
rest are discarded).
|
| UserAbort |
TerminationCondition implementation that allows for user-initiated
termination of an evolutionary algorithm. |