Algorithm::Evolutionary

Perl module for performing paradigmfree evolutionary algorithms.


0.80 
Algorithm::Evolutionary::Experiment

Class for setting up an experiment with algorithms and population


3.4 
Algorithm::Evolutionary::Fitness::Any

Façade for any function so that it can be used as fitness


3.2 
Algorithm::Evolutionary::Fitness::Base

Base class for fitness functions


3.1 
Algorithm::Evolutionary::Fitness::ECC

Error Correcting codes problem generator


3.2 
Algorithm::Evolutionary::Fitness::Knapsack

Fitness function for the knapsack problem


3.1 
Algorithm::Evolutionary::Fitness::MMDP

Massively Multimodal Deceptive Problem


3.0 
Algorithm::Evolutionary::Fitness::ONEMAX

Fitness function for the ONEMAX or countones problem


3.0 
Algorithm::Evolutionary::Fitness::P_Peaks

P Peaks problem generator


3.4 
Algorithm::Evolutionary::Fitness::Rastrigin

Implementation of Rastrigin's function


3.3 
Algorithm::Evolutionary::Fitness::Royal_Road

Mitchell's Royal Road function


3.1 
Algorithm::Evolutionary::Fitness::String

Base class for stringbased fitness functors


3.0 
Algorithm::Evolutionary::Fitness::Trap

'Trap' fitness function for evolutionary algorithms


3.2 
Algorithm::Evolutionary::Fitness::ZDT1

ZitzlerDebThiele #1 Multiobjective test function


3.001 
Algorithm::Evolutionary::Fitness::wP_Peaks

wP Peaks problem generator  weighted version of P_Peaks


3.002 
Algorithm::Evolutionary::Hash_Wheel

Random selector of things depending on probabilities


1.2 
Algorithm::Evolutionary::Individual::Any

Wrapper around any Perl class, turns it into a *Chromosome*


3.0 
Algorithm::Evolutionary::Individual::Base

Base class for chromosomes that knows how to build them, and has some helper methods.


3.3 
Algorithm::Evolutionary::Individual::BitString

Classic bitstring individual for evolutionary computation; usually called *chromosome*


3.4 
Algorithm::Evolutionary::Individual::Bit_Vector

Classic bitstring individual for evolutionary computation; usually called chromosome, and using a different implementation from Algorithm::Evolutionary::Individual::BitString


3.1 
Algorithm::Evolutionary::Individual::String

A character string to be evolved. Useful mainly in word games


3.7 
Algorithm::Evolutionary::Individual::Tree

A Direct Acyclic Graph, or tree, useful for Genetic ProgrammingStyle stuff


3.1 
Algorithm::Evolutionary::Individual::Vector

Array as an individual for evolutionary computation


3.2 
Algorithm::Evolutionary::Op::Animated_GIF_Output

Creates an animated GIF, a frame per generation. Useful for binary strings.


1.005 
Algorithm::Evolutionary::Op::ArithCrossover

Arithmetic crossover operator; performs the average of the n parents crossed


3.001 
Algorithm::Evolutionary::Op::Base

Base class for Algorithm::Evolutionary operators,


3.3 
Algorithm::Evolutionary::Op::Bitflip

Bitflip mutation


3.3 
Algorithm::Evolutionary::Op::Breeder

Even more customizable single generation for an evolutionary algorithm.


1.4 
Algorithm::Evolutionary::Op::Breeder_Diverser

Like Breeder, only it tries to cross only individuals that are different


1.7 
Algorithm::Evolutionary::Op::CX

(Cycle crossover)  2point crossover operator; Builds offspring in such a way that each gene comes from one of the parents. Preserves the absolute position of the elements in the parent sequence


3.2 
Algorithm::Evolutionary::Op::CanonicalGA

Canonical Genetic Algorithm, with any representation


3.6 
Algorithm::Evolutionary::Op::Canonical_GA_NN

Canonical Genetic Algorithm that does not rank population


3.6 
Algorithm::Evolutionary::Op::ChangeLengthMutation

Increases/decreases by one atom the length of the string


3.1 
Algorithm::Evolutionary::Op::Combined

Combinator of several operators of the same arity, unary or binary


1.2 
Algorithm::Evolutionary::Op::Convergence_Terminator

Checks for termination of an algorithm, returns true if a certain percentage of the population is the same


3.1 
Algorithm::Evolutionary::Op::Creator

Operator that generates groups of individuals, of the intended class


3.1 
Algorithm::Evolutionary::Op::Crossover

npoint crossover operator; puts fragments of the second operand into the first operand


3.002 
Algorithm::Evolutionary::Op::DeltaTerm

Termination condition for an algorithm; checks that the difference of the best to a target is less than a delta


3.0 
Algorithm::Evolutionary::Op::EDA_step

Single step for a Estimation of Distribution Algorithm


1.5 
Algorithm::Evolutionary::Op::Easy

evolutionary algorithm, single generation, with variable operators.


3.5 
Algorithm::Evolutionary::Op::Easy_MO

Multiobjecttive evolutionary algorithm, single generation, with variable operators


3.6 
Algorithm::Evolutionary::Op::Eval::General

General and simple population evaluator


3.000 
Algorithm::Evolutionary::Op::Eval::MO_Rank

Multiobjective evaluator based on Pareto rank


3.002 
Algorithm::Evolutionary::Op::FullAlgorithm

Skeleton class for a fullyfeatured evolutionary algorithm


3.0 
Algorithm::Evolutionary::Op::GaussianMutation

Changes numeric chromosome components following the gaussian distribution.


3.4 
Algorithm::Evolutionary::Op::Gene_Boundary_Crossover

npoint crossover operator that restricts crossing point to gene boundaries


3.002 
Algorithm::Evolutionary::Op::GeneralGeneration

Customizable single generation for an evolutionary algorithm.


3.2 
Algorithm::Evolutionary::Op::Generation_Skeleton

Even more customizable single generation for an evolutionary algorithm.


3.3 
Algorithm::Evolutionary::Op::GenerationalTerm

Checks for termination of an algorithm.


3.0 
Algorithm::Evolutionary::Op::IncMutation

Increments/decrements by one the value of one of the components of the string, takes into account the char class


3.001 
Algorithm::Evolutionary::Op::Inverover

Michalewicz's inverover Operator.


3.0 
Algorithm::Evolutionary::Op::LinearFreezer

Used by Simulated Annealing algorithms, reduces temperature lineally.


3.1 
Algorithm::Evolutionary::Op::Mutation

BitFlip mutation, changes several bits in a bitstring, depending on the probability


3.1 
Algorithm::Evolutionary::Op::NoChangeTerm

Checks for termination of an algorithm; terminates when several generations transcur without change


3.0 
Algorithm::Evolutionary::Op::Novelty_Mutation

Mutation guaranteeing new individual is not in the population


3.001 
Algorithm::Evolutionary::Op::Permutation

Permutation. Got it?


3.7 
Algorithm::Evolutionary::Op::Population_Output

Flexible population printing class


3.001 
Algorithm::Evolutionary::Op::QuadXOver

Npoint crossover operator that changes operands


3.104 
Algorithm::Evolutionary::Op::Quad_Crossover_Diff

Uniform crossover, but interchanges only those atoms that are different


1.102 
Algorithm::Evolutionary::Op::Replace_Different

Incorporate individuals into the population replacing the worst ones but only if they are different.


1.3 
Algorithm::Evolutionary::Op::Replace_Worst

Incorporate individuals into the population replacing the worst ones


3.2 
Algorithm::Evolutionary::Op::RouletteWheel

Fitnessproportional selection, using a roulette wheel.


3.1 
Algorithm::Evolutionary::Op::Selector

Abstract base class for population selectors


3.0 
Algorithm::Evolutionary::Op::SimulatedAnnealing

An operator that performs the simulated annealing algorithm on an individual, using an external freezing schedule


3.1 
Algorithm::Evolutionary::Op::Storing

Applies the op and keeps the result


3.001 
Algorithm::Evolutionary::Op::StringRand

randomly change chars in a string


3.001 
Algorithm::Evolutionary::Op::String_Mutation

Single character string mutation


3.007 
Algorithm::Evolutionary::Op::Tournament_Selection

Tournament selector, takes individuals from one population and puts them into another


1.5 
Algorithm::Evolutionary::Op::TreeMutation

GPlike mutation operator for trees


3.1 
Algorithm::Evolutionary::Op::Uniform_Crossover

interchanges a set of atoms from one parent to the other.


3.2 
Algorithm::Evolutionary::Op::Uniform_Crossover_Diff

Uniform crossover, but interchanges only those atoms that are different


3.106 
Algorithm::Evolutionary::Op::VectorCrossover

Crossover for Algorithm::Evolutionary::Individual::Vector.


3.1 
Algorithm::Evolutionary::Run

Class for setting up an experiment with algorithms and population


3.2 
Algorithm::Evolutionary::Utils

Container module with a hodgepodge of functions


3.4 
Algorithm::Evolutionary::Wheel

Random selector of things depending on probabilities


3.6 