Algorithm::Evolutionary::Individual::BitString - Classic bitstring individual for evolutionary computation; 
                 usually called I<chromosome>


    use Algorithm::Evolutionary::Individual::BitString;
    my $indi = new  10 ; # Build random bitstring with length 10
                                   # Each element in the range 0 .. 1
    my $indi3 = new Algorithm::Evolutionary::Individual::BitString;
    $indi3->set( length => 20 );   #Sets values, but does not build the string

    $indi3->randomize(); #Creates a random bitstring with length as above

    print $indi3->Atom( 7 );       #Returns the value of the 7th character
    $indi3->Atom( 3 ) = '2.35';       #Sets the value
    $indi3->addAtom( 1 ); #Adds a new character to the bitstring at the end
    my $indi4 = Algorithm::Evolutionary::Individual::BitString->fromString( '10110101');   #Creates an individual from that string
    my $indi5 = $indi4->clone(); #Creates a copy of the individual
    my @array = qw( 0 1 0 1 0 0 1 ); #Create a tied array
    tie my @vector, 'Algorithm::Evolutionary::Individual::BitString', @array;
    print tied( @vector )->asXML();
    print $indi3->asString(); #Prints the individual
    print $indi3->asXML() #Prints it as XML. See

Base Class



Bitstring Individual for ao GA



Creates a new random bitstring individual, with fixed initial length, and uniform distribution of bits.


Sets values of an individual; takes a hash as input. Keys are prepended an underscore and turn into instance variables


  This file is released under the GPL. See the LICENSE file included in this distribution,
  or go to
  CVS Info: $Date: 2002/06/21 09:22:00 $ 
  $Header: /cvsroot/opeal/opeal/Algorithm/Evolutionary/Individual/,v 1.6 2002/06/21 09:22:00 jmerelo Exp $ 
  $Author: jmerelo $ 
  $Revision: 1.6 $
  $Name $