|
Algorithm::Evolutionary
|
Perl module for performing paradigm-free evolutionary algorithms.
|
|
0.67 |
|
Algorithm::Evolutionary::Experiment
|
Class for setting up an experiment with algorithms and population
|
|
2.7 |
|
Algorithm::Evolutionary::Fitness::Base
|
Base class for Fitness functions
|
|
2.2 |
|
Algorithm::Evolutionary::Fitness::ECC
|
Error Correcting codes problem generator
|
|
2.3 |
|
Algorithm::Evolutionary::Fitness::Knapsack
|
Fitness function for the knapsack problem
|
|
2.2 |
|
Algorithm::Evolutionary::Fitness::MMDP
|
Massively Multimodal Deceptive Problem
|
|
2.2 |
|
Algorithm::Evolutionary::Fitness::ONEMAX
|
Fitness function for the ONEMAX or count-ones problem
|
|
2.2 |
|
Algorithm::Evolutionary::Fitness::P_Peaks
|
P Peaks problem generator
|
|
2.2 |
|
Algorithm::Evolutionary::Fitness::Royal_Road
|
Mitchell's Royal Road function
|
|
2.2 |
|
Algorithm::Evolutionary::Fitness::String
|
Base class for string-based fitness functors
|
|
2.2 |
|
Algorithm::Evolutionary::Fitness::wP_Peaks
|
wP Peaks problem generator - weighted version of P_Peaks
|
|
2.2 |
|
Algorithm::Evolutionary::Individual::Any
|
Wrapper around any Perl class, turns it into a *Chromosome*
|
|
2.2 |
|
Algorithm::Evolutionary::Individual::Base
|
Base class for chromosomes that knows how to build them, and has some helper methods.
|
|
2.6 |
|
Algorithm::Evolutionary::Individual::BitString
|
Classic bitstring individual for evolutionary computation; usually called I<chromosome>
|
|
2.1 |
|
Algorithm::Evolutionary::Individual::Bit_Vector
|
Classic bitstring individual for evolutionary computation; usually called I<chromosome>, and using a different implementation from L<Algorithm::Evolutionary::Individual::BitString>
|
|
2.3 |
|
Algorithm::Evolutionary::Individual::String
|
A character string to be evolved. Useful mainly in word games
|
|
2.2 |
|
Algorithm::Evolutionary::Individual::Tree
|
A Direct Acyclic Graph, or tree, useful for Genetic Programming-Style stuff
|
|
2.2 |
|
Algorithm::Evolutionary::Individual::Vector
|
Array as an individual for evolutionary computation
|
|
2.1 |
|
Algorithm::Evolutionary::Op::ArithCrossover
|
Arithmetic crossover operator; performs the average of the n parents crossed
|
|
2.1 |
|
Algorithm::Evolutionary::Op::Base
|
Base class for OPEAL operators; operators are any object with the "apply" method, which does things to individuals or populations.
|
|
2.7 |
|
Algorithm::Evolutionary::Op::Bitflip
|
Bit-flip mutation
|
|
2.2 |
|
Algorithm::Evolutionary::Op::CX
|
(Cycle crossover) - 2-point crossover operator; Builds offspreing in such a way that each gene comes from one of the parents. Preserves the absolute position of the elements in the parent sequence
|
|
2.1 |
|
Algorithm::Evolutionary::Op::CanonicalGA
|
Canonical Genetic Algorithm, with any representation
|
|
2.3 |
|
Algorithm::Evolutionary::Op::ChangeLengthMutation
|
Increases/decreases by one the length of the string
|
|
2.1 |
|
Algorithm::Evolutionary::Op::Convergence_Terminator
|
Checks for termination of an algorithm, returns true if a certain percentage of the population is the same
|
|
2.3 |
|
Algorithm::Evolutionary::Op::Creator
|
Operator that generates groups of individuals, of the intended class
|
|
2.3 |
|
Algorithm::Evolutionary::Op::Crossover
|
n-point crossover operator; puts fragments of the second operand into the first operand
|
|
2.6 |
|
Algorithm::Evolutionary::Op::DeltaTerm
|
Termination condition for an algorithm; checks that the difference of the best to a target is less than a delta
|
|
2.2 |
|
Algorithm::Evolutionary::Op::Easy
|
evolutionary algorithm, single generation, with variable operators.
|
|
2.3 |
|
Algorithm::Evolutionary::Op::FullAlgorithm
|
Skeleton class for a fully-featured evolutionary algorithm
|
|
2.3 |
|
Algorithm::Evolutionary::Op::GaussianMutation
|
Changes numeric chromosome components following the gaussian distribution
|
|
2.1 |
|
Algorithm::Evolutionary::Op::Gene_Boundary_Crossover
|
n-point crossover operator that restricts crossing point to gene boundaries
|
|
2.1 |
|
Algorithm::Evolutionary::Op::GeneralGeneration
|
Customizable single generation for an evolutionary algorithm.
|
|
2.3 |
|
Algorithm::Evolutionary::Op::Generation_Skeleton
|
Even more customizable single generation for an evolutionary algorithm.
|
|
2.2 |
|
Algorithm::Evolutionary::Op::GenerationalTerm
|
Checks for termination of an algorithm.
|
|
2.3 |
|
Algorithm::Evolutionary::Op::IncMutation
|
Increments/decrements by one the value of one of the components of the string, takes into account the char class
|
|
2.1 |
|
Algorithm::Evolutionary::Op::Inverover
|
Michalewicz's inver-over Operator.
|
|
2.2 |
|
Algorithm::Evolutionary::Op::LinearFreezer
|
used by Simulated Annealing algorithms, reduces temperature lineally.
|
|
2.2 |
|
Algorithm::Evolutionary::Op::Mutation
|
BitFlip mutation, changes several bits in a bitstring, depending on the probability
|
|
2.1 |
|
Algorithm::Evolutionary::Op::NoChangeTerm
|
Checks for termination of an algorithm; terminates when several generations transcur without change
|
|
2.2 |
|
Algorithm::Evolutionary::Op::Novelty_Mutation
|
Mutation guaranteeing new individual is not in the population
|
|
2.4 |
|
Algorithm::Evolutionary::Op::Permutation
|
Per-mutation. Got it?
|
|
2.1 |
|
Algorithm::Evolutionary::Op::QuadXOver
|
n-point crossover operator; puts a part of the second operand into the first operand; can be 1 or 2 points.
|
|
2.2 |
|
Algorithm::Evolutionary::Op::Replace_Worst
|
Incorporate an individual into the population replacing the worst one
|
|
2.2 |
|
Algorithm::Evolutionary::Op::RouletteWheel
|
Fitness-proportional selection, using a roulette wheel
|
|
2.3 |
|
Algorithm::Evolutionary::Op::Selector
|
Abstract base class for population selectors
|
|
2.3 |
|
Algorithm::Evolutionary::Op::SimulatedAnnealing
|
An operator that performs the simulated annealing algorithm on an individual, using an external freezing schedule
|
|
2.2 |
|
Algorithm::Evolutionary::Op::Storing
|
Applies the op and keeps the result
|
|
2.2 |
|
Algorithm::Evolutionary::Op::TournamentSelect
|
Tournament selector, takes individuals from one population and puts them into another
|
|
2.3 |
|
Algorithm::Evolutionary::Op::TreeMutation
|
GP-like mutation operator for trees
|
|
2.1 |
|
Algorithm::Evolutionary::Op::Uniform_Crossover
|
interchanges a set of atoms from one parent to the other.
|
|
2.6 |
|
Algorithm::Evolutionary::Op::VectorCrossover
|
Crossover for Algorithm::Evolutionary::Individual::Vector.
|
|
2.1 |
|
Algorithm::Evolutionary::Run
|
Class for setting up an experiment with algorithms and population
|
|
2.1 |
|
Algorithm::Evolutionary::Utils
|
Container module with a hodgepodge of functions
|
|
2.6 |
|
Algorithm::Evolutionary::Wheel
|
Random selector of things depending on probabilities
|
|
2.3 |
(0 Reviews)
[ Rate this distribution ]
