View on
MetaCPAN is shutting down
For details read Perl NOC. After June 25th this page will redirect to
J. J. Merelo-Guervós > Algorithm-Evolutionary-0.78


This Release Algorithm-Evolutionary-0.78  [Download] [Browse 08 Jul 2012
Latest Release Algorithm-Evolutionary-0.80  [Download] [Browse 31 Oct 2014
Other Releases
Links Discussion Forum ] [ View/Report Bugs (0) ] [ Dependencies ] [ Other Tools ]
CPAN Testers PASS (42)   FAIL (60)   [ View Reports ] [ Perl/Platform Version Matrix ]
Rating      (0 Reviews) [ Rate this distribution ]
License The GNU General Public License, Version not specified
Special Files


Algorithm::Evolutionary Perl module for performing paradigm-free evolutionary algorithms.     0.78
Algorithm::Evolutionary::Experiment Class for setting up an experiment with algorithms and population     3.002
Algorithm::Evolutionary::Fitness::Any Façade for any function to look like fitness     3.001
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 count-ones problem     3.0
Algorithm::Evolutionary::Fitness::P_Peaks P Peaks problem generator     3.1
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 string-based fitness functors     3.0
Algorithm::Evolutionary::Fitness::Trap 'Trap' fitness function for evolutionary algorithms     3.1
Algorithm::Evolutionary::Fitness::ZDT1 Zitzler-Deb-Thiele #1 Multiobjective test function     3.001
Algorithm::Evolutionary::Fitness::wP_Peaks wP Peaks problem generator - weighted version of P_Peaks     3.001
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.002
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.005
Algorithm::Evolutionary::Individual::Tree A Direct Acyclic Graph, or tree, useful for Genetic Programming-Style 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, that is any object with the "apply" method, which does things to individuals or populations.     3.2
Algorithm::Evolutionary::Op::Bitflip Bit-flip mutation     3.3
Algorithm::Evolutionary::Op::Breeder Even more customizable single generation for an evolutionary algorithm.     1.2
Algorithm::Evolutionary::Op::Breeder_Diverser Like Breeder, only it tries to cross only individuals that are different     1.5
Algorithm::Evolutionary::Op::CX (Cycle crossover) - 2-point 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.1
Algorithm::Evolutionary::Op::CanonicalGA Canonical Genetic Algorithm, with any representation     3.106
Algorithm::Evolutionary::Op::Canonical_GA_NN Canonical Genetic Algorithm that does not ranks population     3.006
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 kind, unary or binary     1.001
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 n-point 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.4
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 fully-featured evolutionary algorithm     3.0
Algorithm::Evolutionary::Op::GaussianMutation Changes numeric chromosome components following the gaussian distribution     3.103
Algorithm::Evolutionary::Op::Gene_Boundary_Crossover n-point crossover operator that restricts crossing point to gene boundaries     3.002
Algorithm::Evolutionary::Op::GeneralGeneration Customizable single generation for an evolutionary algorithm.     3.0
Algorithm::Evolutionary::Op::Generation_Skeleton Even more customizable single generation for an evolutionary algorithm.     3.0
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 inver-over Operator.     3.0
Algorithm::Evolutionary::Op::LinearFreezer Used by Simulated Annealing algorithms, reduces temperature lineally.     3.0
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 Per-mutation. Got it?     3.5
Algorithm::Evolutionary::Op::Population_Output Flexible population printing class     3.001
Algorithm::Evolutionary::Op::QuadXOver N-point 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.1
Algorithm::Evolutionary::Op::Replace_Worst Incorporate individuals into the population replacing the worst ones     3.2
Algorithm::Evolutionary::Op::RouletteWheel Fitness-proportional selection, using a roulette wheel     3.0
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.0
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.005
Algorithm::Evolutionary::Op::TournamentSelect Tournament selector, takes individuals from one population and puts them into another     3.0
Algorithm::Evolutionary::Op::Tournament_Selection Tournament selector, takes individuals from one population and puts them into another     1.3
Algorithm::Evolutionary::Op::TreeMutation GP-like 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.105
Algorithm::Evolutionary::Op::VectorCrossover Crossover for Algorithm::Evolutionary::Individual::Vector.     3.0
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.003
Algorithm::Evolutionary::Wheel Random selector of things depending on probabilities     3.6


XML Syntax and semantics of the XML files used in OPEAL Canonical Genetic Algorithm on a simple fitness function Find the dot maximally covered by (random) rectangles Implementation of the Tide optimization using A::E Optimization of the tide function using A::E