-
-
29 Mar 2021 11:30:17 UTC
- Browse (raw)
- Changes
- How to Contribute
- Repository
- Issues (1)
- Testers (88 / 0 / 0)
- Kwalitee
Bus factor: 1- License: open_source
- Activity
24 month- Tools
- Download (97.19KB)
- MetaCPAN Explorer
- Permissions
- Subscribe to distribution
- Permalinks
- This version
- Latest version
and 1 contributors- JJ Merelo <jj /at/ merelo.net>
- Dependencies
- Algorithm::Permute
- Bit::Vector
- Clone
- GD
- Math::Random
- Memoize
- Object::Array
- Pod::Escapes
- Sort::Key
- Statistics::Basic
- String::Random
- Test::More
- Test::Pod
- Time::HiRes
- Tree::DAG_Node
- XML::Parser
- XML::Parser::Style::EasyTree
- YAML
- constant
- version
- and possibly others
- Reverse dependencies
- CPAN Testers List
- Dependency graph
Documentation
Canonical Genetic Algorithm on a simple fitness functionFind the dot maximally covered by (random) rectanglesImplementation of the Tide optimization using A::EOptimization of the tide function using A::EModules
Perl module for performing paradigm-free evolutionary algorithms.Class for setting up an experiment with algorithms and populationFaçade for any function so that it can be used as fitnessBase class for fitness functionsError Correcting codes problem generatorFitness function for the knapsack problemMassively Multimodal Deceptive ProblemFitness function for the ONEMAX or count-ones problemP Peaks problem generatorImplementation of Rastrigin's functionMitchell's Royal Road functionBase class for string-based fitness functors'Trap' fitness function for evolutionary algorithmsZitzler-Deb-Thiele #1 Multiobjective test functionwP Peaks problem generator - weighted version of P_PeaksRandom selector of things depending on probabilitiesWrapper around any Perl data structure, turns it into a ChromosomeBase class for chromosomes that knows how to build them, and has some helper methods.Classic bitstring individual for evolutionary computation; usually called chromosomeClassic bitstring individual for evolutionary computation; usually called chromosome, and using a different implementation from Algorithm::Evolutionary::Individual::BitStringA character string to be evolved. Useful mainly in word gamesA Direct Acyclic Graph, or tree, useful for Genetic Programming-Style stuffArray as an individual for evolutionary computationCreates an animated GIF, a frame per generation. Useful for binary strings.Arithmetic crossover operator; performs the average of the n parents crossedBase class for Algorithm::Evolutionary operators,Bit-flip mutationEven more customizable single generation for an evolutionary algorithm.Like Breeder, only it tries to cross only individuals that are differentCanonical Genetic Algorithm, with any representationCanonical Genetic Algorithm that does not rank populationIncreases/decreases by one atom the length of the stringCombinator of several operators of the same arity, unary or binaryChecks for termination of an algorithm, returns true if a certain percentage of the population is the sameOperator that generates groups of individuals, of the intended classn-point crossover operator; puts fragments of the second operand into the first operandTermination condition for an algorithm; checks that the difference of the best to a target is less than a deltaSingle step for a Estimation of Distribution Algorithmevolutionary algorithm, single generation, with variable operators.Multiobjecttive evolutionary algorithm, single generation, with variable operatorsGeneral and simple population evaluatorMultiobjective evaluator based on Pareto rankSkeleton class for a fully-featured evolutionary algorithmChanges numeric chromosome components following the gaussian distribution.n-point crossover operator that restricts crossing point to gene boundariesCustomizable single generation for an evolutionary algorithm.Even more customizable single generation for an evolutionary algorithm.Checks for termination of an algorithm.Increments/decrements by one the value of one of the components of the string, takes into account the char classMichalewicz's inver-over Operator.Used by Simulated Annealing algorithms, reduces temperature lineally.Bitflip mutation, changes several bits in a bitstring, depending on the probabilityChecks for termination of an algorithm; terminates when several generations transcur without changeMutation guaranteeing new individual is not in the populationPer-mutation. Got it?Flexible population printing classN-point crossover operator that changes operandsUniform crossover, but interchanges only those atoms that are differentIncorporate individuals into the population replacing the worst ones but only if they are different.Incorporate individuals into the population replacing the worst onesFitness-proportional selection, using a roulette wheel.Abstract base class for population selectorsAn operator that performs the simulated annealing algorithm on an individual, using an external freezing scheduleApplies the op and keeps the resultrandomly change chars in a stringSingle character string mutationTournament selector, takes individuals from one population and puts them into anotherGP-like mutation operator for treesinterchanges a set of atoms from one parent to the other.Uniform crossover, but interchanges only those atoms that are differentCrossover for Algorithm::Evolutionary::Individual::Vector.Class for setting up an experiment with algorithms and populationContainer module with a hodgepodge of functionsRandom selector of things depending on probabilitiesModule Install Instructions
To install Algorithm::Evolutionary, copy and paste the appropriate command in to your terminal.
cpanm Algorithm::Evolutionary
perl -MCPAN -e shell install Algorithm::Evolutionary
For more information on module installation, please visit the detailed CPAN module installation guide.