Algorithm-Evolutionary-Simple
view release on metacpan or search on metacpan
* lib/Algorithm/Evolutionary/Simple.pm: just a few test changes to bump up version. Adds also exception test.
2012-03-27 Juan J. Merelo Guervós <jjmerelo@gmail.com>
* script/simple-EA.pl: Used the wrong file for this, so I changed
the good one, this one. Changed a bit docs, too.
* lib/Algorithm/Evolutionary/Simple.pm
(get_pool_binary_tournament): Added binary tournament, a less
greedy way of selection which seems to work a bit better and is a
bit faster.
2011-12-06 Juan J. Merelo Guervós <jjmerelo@gmail.com>
* lib/Algorithm/Evolutionary/Simple.pm (single_generation):
Changing documentation and adding a rather useless
single_generation
2011-11-06 Juan J. Merelo <jmerelo@sheldon>
lib/Algorithm/Evolutionary/Simple.pm view on Meta::CPAN
Mainly for internal use, $wheel has the normalized probability, and
$slots the number of individuals to return.
=head2 single_generation( $population_arrayref, $fitness_of_hashref )
Applies all steps to arrive to a new generation, except
evaluation. Keeps the two best for the next generation.
=head2 get_pool_roulette_wheel( $population_arrayref, $fitness_of_hashref, $how_many_I_need )
Obtains a pool of new chromosomes using fitness_proportional selection
=head2 get_pool_binary_tournament( $population_arrayref, $fitness_of_hashref, $how_many_I_need )
Obtains a pool of new chromosomes using binary tournament, a greedier method.
=head2 produce_offspring( $population_hashref, $how_many_I_need )
Uses mutation first and then crossover to obtain a new population
( run in 0.311 second using v1.01-cache-2.11-cpan-94b05bcf43c )