Algorithm::Evolutionary::Wheel - Random selector of things depending on probabilities

Creates a "roulette wheel" for spinning and selecting stuff. It will be used in several places; mainly in the Algorithm::Evolutionary::Op::CanonicalGA. Take care that fitness must be non-zero positives; since if they aren't, roulette wheel won't work...

/Algorithm-Evolutionary-0.80 - 31 Oct 2014 07:18:32 GMT

Algorithm::Evolutionary::Hash_Wheel - Random selector of things depending on probabilities

Creates a "roulette wheel" for spinning and selecting stuff. It will be used in several places; mainly in the Algorithm::Evolutionary::Op::CanonicalGA. It's similar to Algorithm::Evolutionary::Wheel, but with a hash instead of an array. Probably shou...

/Algorithm-Evolutionary-0.80 - 31 Oct 2014 07:18:32 GMT

Algorithm::Evolutionary::Op::RouletteWheel - Fitness-proportional selection, using a roulette wheel.

Roulette wheel selection tries to select as many copies of the individual as it corresponds to its fitness. It is used in the canonical GA. Some information on this method of selection can be found in this GA tutorial <http://www.geatbx.com/docu/algs...

/Algorithm-Evolutionary-0.80 - 31 Oct 2014 07:18:32 GMT

Algorithm::Evolutionary::Simple - Run a simple, canonical evolutionary algorithm in Perl

Assorted functions needed by an evolutionary algorithm, mainly for demos and simple clients....

/Algorithm-Evolutionary-Simple-0.3 - 17 Aug 2017 09:02:37 GMT

Algorithm::MasterMind::EvoRank - Evolutionary algorithm with the partition method and ranked fitness, prepared for GECCO 2010

The partition method was introduced in a 2010 paper, and then changed by Runarsson and Merelo to incorporate it in the genetic search. It was prepared for a conference paper, this one: @INPROCEEDINGS{mm:cig, author={Merelo, J.J. and Mora, A.M. and Ru...

/Algorithm-MasterMind-v0.4.5 - 19 Jul 2012 18:06:25 GMT

Algorithm::Evolutionary::Op::CanonicalGA - Canonical Genetic Algorithm, with any representation

The canonical classical genetic algorithm evolves a population of bitstrings until they reach the optimum fitness. It performs mutation on the bitstrings by flipping a single bit, crossover interchanges a part of the two parents. The first operator s...

/Algorithm-Evolutionary-0.80 - 31 Oct 2014 07:18:32 GMT

Algorithm::Evolutionary::Op::Canonical_GA_NN - Canonical Genetic Algorithm that does not rank population

The canonical classical genetic algorithm evolves a population of bitstrings until they reach the optimum fitness. It performs mutation on the bitstrings by flipping a single bit, crossover interchanges a part of the two parents. The first operator s...

/Algorithm-Evolutionary-0.80 - 31 Oct 2014 07:18:32 GMT

7 results (0.033 seconds)