GSP
Quick Navigator

Search Site

Unix VPS
A - Starter
B - Basic
C - Preferred
D - Commercial
MPS - Dedicated
Previous VPSs
* Sign Up! *

Support
Contact Us
Online Help
Handbooks
Domain Status
Man Pages

FAQ
Virtual Servers
Pricing
Billing
Technical

Network
Facilities
Connectivity
Topology Map

Miscellaneous
Server Agreement
Year 2038
Credits
 

USA Flag

 

 

Man Pages
Algorithm::Evolutionary::Op::Canonical_GA_NN(3) User Contributed Perl Documentation Algorithm::Evolutionary::Op::Canonical_GA_NN(3)

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

  # Straightforward instance, with all defaults (except for fitness function)
  my $algo = new Algorithm::Evolutionary::Op::Canonical_GA_NN; 

  #Define an easy single-generation algorithm with predefined mutation and crossover
  my $m = new Algorithm::Evolutionary::Op::Bitflip; #Changes a single bit
  my $c = new Algorithm::Evolutionary::Op::QuadXOver; #Classical 2-point crossover
  my $generation = new Algorithm::Evolutionary::Op::Canonical_GA_NN( 0.2, [$m, $c] );

   my $generation = new Algorithm::Evolutionary::Op::Canonical_GA_NN( undef , [$m, $c] ); # Defaults to 0.4

Algorithm::Evolutionary::Op::Base

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 should be unary (a la mutation) and the second binary (a la crossover) they will be applied in turn to couples of the population.

This is a fast version of the canonical GA, useful for large populations, since it avoids the expensive rank operation. Roulette wheel selection, still, is kind of slow.

Creates an algorithm, with the usual operators. Includes a default mutation and crossover, in case they are not passed as parameters. The first element in the array ref should be an unary, and the second a binary operator. This binary operator must accept parameters by reference, not value; it will modify them. For the time being, just Algorithm::Evolutionary::Op::QuadXOver works that way.

Applies a single generation of the algorithm to the population; checks that it receives a ref-to-array as input, croaks if it does not. This population should be already evaluated. Returns a new population for next generation, unsorted.

Algorithm::Evolutionary::Op::Easy
Algorithm::Evolutionary::Wheel
Algorithm::Evolutionary::Fitness::Base
Of course, Algorithm::Evolutionary::Fitness::CanonicalGA

You will also find a canonical-genetic-algorithm.pl example within this bundle. Check it out for usage examples

  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
2014-10-25 perl v5.32.1

Search for    or go to Top of page |  Section 3 |  Main Index

Powered by GSP Visit the GSP FreeBSD Man Page Interface.
Output converted with ManDoc.