Algorithm-Evolutionary 0.67
- Released by
- JMERELO
- Version
- Release Date
- 2009-03-30
- Kwalitee
- 140.62
- Core Kwalitee
- 93.75
- LINKS
Algorithm-Evolutionary 0.67
Kwalitee Issues
- use_strict
-
Add 'use strict' (or its equivalents) to all modules, or convince us that your favorite module is well-known enough and people can easily see the modules are strictly written.
Error: Algorithm::Evolutionary
- no_pod_errors
-
Remove the POD errors. You can check for POD errors automatically by including Test::Pod to your test suite.
Error: Algorithm-Evolutionary-0.67/lib/Algorithm/Evolutionary/Individual/String.pm -- Around line 28: Non-ASCII character seen before =encoding in 'ñ);'. Assuming CP1252 Algorithm-Evolutionary-0.67/lib/Algorithm/Evolutionary/Op/CX.pm -- Around line 38: alternative text 'http://www.cs.bham.ac.uk/~rmp/slide_book/node4.html#SECTION00444300000000000000' contains non-escaped | or / Algorithm-Evolutionary-0.67/lib/Algorithm/Evolutionary/Op/RouletteWheel.pm -- Around line 22: alternative text 'http://www.geatbx.com/docu/algselct.html#nameselectionrws' contains non-escaped | or / Algorithm-Evolutionary-0.67/lib/Algorithm/Evolutionary/Op/SimulatedAnnealing.pm -- Around line 18: L<> starts or ends with whitespace Algorithm-Evolutionary-0.67/lib/Algorithm/Evolutionary.pm -- Around line 92: Non-ASCII character seen before =encoding in 'Esparcia-Alcázar'. Assuming CP1252
- meta_yml_declares_perl_version
-
If you are using Build.PL define the {requires}{perl} = VERSION field. If you are using MakeMaker (Makefile.PL) you should upgrade ExtUtils::MakeMaker to 6.48 and use MIN_PERL_VERSION parameter. Perl::MinimumVersion can help you determine which version of Perl your module needs.
- has_meta_json
-
Add a META.json to the distribution. Your buildtool should be able to autogenerate it.
- use_warnings
-
Add 'use warnings' (or its equivalents) to all modules, or convince us that your favorite module is well-known enough and people can easily see the modules warn when something bad happens.
Error: Algorithm::Evolutionary
- consistent_version
-
Split the distribution, or fix the version numbers to make them consistent (use the highest version number to avoid version downgrade).
Error: 0.67,2.1,2.2,2.3,2.4,2.6,2.7
- meta_yml_has_provides
-
Add all modules contained in this distribution to the META.yml field 'provides'. Module::Build or Dist::Zilla::Plugin::MetaProvides do this automatically for you.
- meta_yml_has_repository_resource
-
Add a 'repository' resource to the META.yml via 'meta_add' accessor (for Module::Build) or META_ADD parameter (for ExtUtils::MakeMaker).
Modules
| Name | Abstract | Version | View |
|---|---|---|---|
| Algorithm::Evolutionary | Perl module for performing paradigm-free evolutionary algorithms. | 0.67 | metacpan |
| Algorithm::Evolutionary::Experiment | Class for setting up an experiment with algorithms and population | 2.7 | metacpan |
| Algorithm::Evolutionary::Fitness::Base | Base class for Fitness functions | 2.2 | metacpan |
| Algorithm::Evolutionary::Fitness::ECC | Error Correcting codes problem generator | 2.3 | metacpan |
| Algorithm::Evolutionary::Fitness::Knapsack | Fitness function for the knapsack problem | 2.2 | metacpan |
| Algorithm::Evolutionary::Fitness::MMDP | Massively Multimodal Deceptive Problem | 2.2 | metacpan |
| Algorithm::Evolutionary::Fitness::ONEMAX | Fitness function for the ONEMAX or count-ones problem | 2.2 | metacpan |
| Algorithm::Evolutionary::Fitness::P_Peaks | P Peaks problem generator | 2.2 | metacpan |
| Algorithm::Evolutionary::Fitness::Royal_Road | Mitchell's Royal Road function | 2.2 | metacpan |
| Algorithm::Evolutionary::Fitness::String | Base class for string-based fitness functors | 2.2 | metacpan |
| Algorithm::Evolutionary::Fitness::wP_Peaks | wP Peaks problem generator - weighted version of P_Peaks | 2.2 | metacpan |
| Algorithm::Evolutionary::Individual::Any | Wrapper around any Perl class, turns it into a I<Chromosome> | 2.2 | metacpan |
| Algorithm::Evolutionary::Individual::Base | Base class for chromosomes that knows how to build them, and has some helper methods. | 2.6 | metacpan |
| Algorithm::Evolutionary::Individual::BitString | Classic bitstring individual for evolutionary computation; usually called I<chromosome> | 2.1 | metacpan |
| 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 | metacpan |
| Algorithm::Evolutionary::Individual::String | A character string to be evolved. Useful mainly in word games | 2.2 | metacpan |
| Algorithm::Evolutionary::Individual::Tree | 2.2 | metacpan | |
| Algorithm::Evolutionary::Individual::Vector | Array as an individual for evolutionary computation | 2.1 | metacpan |
| Algorithm::Evolutionary::Op::ArithCrossover | Arithmetic crossover operator; performs the average of the n parents crossed | 2.1 | metacpan |
| 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 | metacpan |
| Algorithm::Evolutionary::Op::Bitflip | Bit-flip mutation | 2.2 | metacpan |
| Algorithm::Evolutionary::Op::CX | 2.1 | metacpan | |
| Algorithm::Evolutionary::Op::CanonicalGA | Canonical Genetic Algorithm, with any representation | 2.3 | metacpan |
| Algorithm::Evolutionary::Op::ChangeLengthMutation | Increases/decreases by one the length of the string | 2.1 | metacpan |
| 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 | metacpan |
| Algorithm::Evolutionary::Op::Creator | Operator that generates groups of individuals, of the intended class | 2.3 | metacpan |
| Algorithm::Evolutionary::Op::Crossover | n-point crossover operator; puts fragments of the second operand into the first operand | 2.6 | metacpan |
| 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 | metacpan |
| Algorithm::Evolutionary::Op::Easy | evolutionary algorithm, single generation, with variable operators. | 2.3 | metacpan |
| Algorithm::Evolutionary::Op::FullAlgorithm | Skeleton class for a fully-featured evolutionary algorithm | 2.3 | metacpan |
| Algorithm::Evolutionary::Op::GaussianMutation | Changes numeric chromosome components following the gaussian distribution | 2.1 | metacpan |
| Algorithm::Evolutionary::Op::Gene_Boundary_Crossover | n-point crossover operator that restricts crossing point to gene boundaries | 2.1 | metacpan |
| Algorithm::Evolutionary::Op::GeneralGeneration | Customizable single generation for an evolutionary algorithm. | 2.3 | metacpan |
| Algorithm::Evolutionary::Op::Generation_Skeleton | Even more customizable single generation for an evolutionary algorithm. | 2.2 | metacpan |
| Algorithm::Evolutionary::Op::GenerationalTerm | Checks for termination of an algorithm. | 2.3 | metacpan |
| 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 | metacpan |
| Algorithm::Evolutionary::Op::Inverover | Michalewicz's inver-over Operator. | 2.2 | metacpan |
| Algorithm::Evolutionary::Op::LinearFreezer | used by Simulated Annealing algorithms, reduces temperature lineally. | 2.2 | metacpan |
| Algorithm::Evolutionary::Op::Mutation | BitFlip mutation, changes several bits in a bitstring, depending on the probability | 2.1 | metacpan |
| Algorithm::Evolutionary::Op::NoChangeTerm | Checks for termination of an algorithm; terminates when several generations transcur without change | 2.2 | metacpan |
| Algorithm::Evolutionary::Op::Novelty_Mutation | Mutation guaranteeing new individual is not in the population | 2.4 | metacpan |
| Algorithm::Evolutionary::Op::Permutation | Per-mutation. Got it? | 2.1 | metacpan |
| 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 | metacpan |
| Algorithm::Evolutionary::Op::Replace_Worst | Incorporate an individual into the population replacing the worst one | 2.2 | metacpan |
| Algorithm::Evolutionary::Op::RouletteWheel | Fitness-proportional selection, using a roulette wheel | 2.3 | metacpan |
| Algorithm::Evolutionary::Op::Selector | Abstract base class for population selectors | 2.3 | metacpan |
| Algorithm::Evolutionary::Op::SimulatedAnnealing | 2.2 | metacpan | |
| Algorithm::Evolutionary::Op::Storing | Applies the op and keeps the result | 2.2 | metacpan |
| Algorithm::Evolutionary::Op::TournamentSelect | Tournament selector, takes individuals from one population and puts them into another | 2.3 | metacpan |
| Algorithm::Evolutionary::Op::TreeMutation | GP-like mutation operator for trees | 2.1 | metacpan |
| Algorithm::Evolutionary::Op::Uniform_Crossover | interchanges a set of atoms from one parent to the other. | 2.6 | metacpan |
| Algorithm::Evolutionary::Op::VectorCrossover | Crossover for L<Algorithm::Evolutionary::Individual::Vector>. | 2.1 | metacpan |
| Algorithm::Evolutionary::Run | Class for setting up an experiment with algorithms and population | 2.1 | metacpan |
| Algorithm::Evolutionary::Utils | Container module with a hodgepodge of functions | 2.6 | metacpan |
| Algorithm::Evolutionary::Wheel | Random selector of things depending on probabilities | 2.3 | metacpan |