Manual Reference Pages - ALGORITHM::EVOLUTIONARY::FITNESS::TRAP (3)
Algorithm::Evolutionary::Fitness::Trap - Trap fitness function for evolutionary algorithms
my $number_of_bits = 5;
my $a = $number_of_bits -1; # Usual default values follow
my $b = $number_of_bits;
my $z = $number_of_bits -1;
my $trap = Algorithm::Evolutionary::Fitness::Trap->new( $number_of_bits, $a, $b, $z );
Trap function act as yucky or deceptive for evolutionary algorithms;
they trap population into going to easier, but local, optima.
new( CW$number_of_bits, [$a = CW$number_of_bits -1, CW$b = CW$number_of_bits, CW$z=$number_of_bits-1])
Creates a new instance of the problem, with the said number of bits
and traps. Uses default values from $number_of_bits if needed
Applies the instantiated problem to a chromosome
trap( CW$string )
Computes the value of the trap function on the $string. Optimum is
number_of_blocs * $b (by default, $b = $l or number of ones)
This file is released under the GPL. See the LICENSE file included in this distribution,
or go to http://www.fsf.org/licenses/gpl.txt
|perl v5.20.3 ||ALGORITHM::EVOLUTIONARY::FITNESS::TRAP (3) ||2014-10-25 |
Visit the GSP FreeBSD Man Page Interface.
Output converted with manServer 1.07.