-
27 Feb 2003 09:53:39 UTC
- Browse (raw)
- Changes
- How to Contribute
- Issues (1)
- Testers (1 / 0 / 0)
- Kwalitee
Bus factor: 1- License: unknown
24 month- Download (45.89KB)
- MetaCPAN Explorer
- Permissions
- Subscribe to distribution
- This version
- Latest version
Documentation
Syntax and semantics of the XML files used in OPEALModules
Perl extension for performing paradigm-free evolutionary algorithms.Class for setting up an experiment with algorithms and populationBase class for chromosomes that knows how to build them, and has some helper methods.Classic bitstring individual for evolutionary computation; usually called chromosomeA character string to be evolved. Useful mainly in word gamesArray as an individual for evolutionary computationArray as an individual for evolutionary computationArithmetic crossover operator; performs the average of the n parents crossedBase class for OPEAL operators; operators are any object with the "apply" method, which does things to individuals or populations.BitFlip mutationCanonical Genetic Algorithm, with any representationIncreases/decreases by one the length of the stringOperator that generates groups of individuals, of the intended classn-point crossover operator; puts a part of the second operand into the first operand; can be 1 or 2 pointsTermination condition for an algorithm; checks that the difference of the best to a target is less than a deltaevolutionary algorithm, single generation, with variable operators.evolutionary algorithm, single generation, with variable operators.Changes numeric chromosome components following the gaussian distributionCustomizable 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 algorithmsBitFlip mutation, changes several bits in a bitstring, depending on the probabilityChecks for termination of an algorithm; terminates when several generations transcur without changeBitFlip mutation, changes several bits in a bitstring, depending on the probabilityn-point crossover operator; puts a part of the second operand into the first operand; can be 1 or 2 points.Fitness-proportional selection, using a roulette wheelAn operator that performs the simulated annealing algorithm on an individual, using an external freezer.Tournament selector, takes individuals from one population and puts them into anotherGP-like mutation operator for treesCrossover for lgorithm::Evolutionary::Individual::Vector.Random selector of things depending on probabilitiesOther files
