In file EO++.h:

template <class Chrom> class EOAgeGA : public EOAlgo<Chrom>

Simple algorithm for evolutionary computation It is not exactly a Simple GA, as defined by Goldberg, it is just a simple implementation of a Genetic Algorithm

Inheritance:


Public Classes

enum age

Public Methods

virtual void operator ()( EOPop<Chrom>& pop )
Run the algorithm
void birthday()
every birthday my life time is one generation shorter
EOAge()
EOAge(const EOAge& age)
EOAgeGA( EOEvaluator<Chrom>& _eval, EOBreeder<Chrom>& _breed, EOTerm<Chrom>& _term)
The ctor takes all necessary object for an evolutionary algorithm as pointers
void lifeTime(unsigned _lifetime)
unsigned lifeTime()
const EOAge& operator = ( const EOAge& age)
Assignment operator for EOAge
friend ostream& operator<<(ostream& os, const EOAge& chrom)
void swap(EOAge& age)
virtual ~EOAgeGA()
Ctor must ve virtual

Public

enum age

Inherited from EOAlgo:

Public Methods

virtual void operator) ( EOPop<EOT>& _pop )

Documentation

Simple algorithm for evolutionary computation It is not exactly a Simple GA, as defined by Goldberg, it is just a simple implementation of a Genetic Algorithm
enum age

EOAge()

EOAge(const EOAge& age)

const EOAge& operator = ( const EOAge& age)
Assignment operator for EOAge

unsigned lifeTime()

void lifeTime(unsigned _lifetime)

void birthday()
every birthday my life time is one generation shorter

void swap(EOAge& age)

friend ostream& operator<<(ostream& os, const EOAge& chrom)

EOAgeGA( EOEvaluator<Chrom>& _eval, EOBreeder<Chrom>& _breed, EOTerm<Chrom>& _term)
The ctor takes all necessary object for an evolutionary algorithm as pointers. These are used so that they can have default null values Initial population can also be passed on. If not, it has to be generated randomly

virtual ~EOAgeGA()
Ctor must ve virtual

virtual void operator ()( EOPop<Chrom>& pop )
Run the algorithm


This class has no child classes.

alphabetic index hierarchy of classes


BinOp