| cart::Add< T > | |
| Tree::Primitives::AddT< T > | Add function primitive (Tree genotype) |
| AlgAEliGpea | Asynchronous elimination global parallel algorithm |
| AlgAEliGpea2 | Asynchronous elimination global parallel algorithm (outdated version) |
| Algorithm | Algorithm base class |
| AlgSGenGpea | Synchronous generational global parallel algorithm |
| cart::And< T > | |
| Binary::Binary | Binary class - implements genotype as a vector of binary coded real values with variable interval and precision |
| Binary::BinaryCrsHalfUniform | Binary genotype: half uniform crossover operator |
| Binary::BinaryCrsOnePoint | Binary genotype: one point crossover operator |
| Binary::BinaryCrsReducedSurrogate | Binary genotype: reduced surrogate crossover operator |
| Binary::BinaryCrsSegmented | Binary genotype: segmented crossover operator |
| Binary::BinaryCrsShuffle | Binary genotype: shuffle crossover operator |
| Binary::BinaryCrsTwoPoint | Binary genotype: two point crossover operator |
| Binary::BinaryCrsUniform | Binary genotype: uniform crossover operator |
| Binary::BinaryMutMix | Binary genotype: mixing mutation operator |
| Binary::BinaryMutSimple | Binary genotype: simple (bit-flip) mutation operator |
| BitString::BitString | BitString class - implements genotype as a series of bits |
| BitString::BitStringCrsOnePoint | BitString genotype: one point crossover operator |
| BitString::BitStringCrsUniform | BitString genotype uniform crossover operator |
| BitString::BitStringMutMix | BitString genotype mixing mutation operator |
| BitString::BitStringMutSimple | BitString genotype simple (one bit) mutation operator |
| cart::Cartesian | |
| cart::CartesianCrsOnePoint | Cartesian genotype: one point crossover operator |
| cart::CartesianMutOnePoint | Cartesian genotype: one point mutation operator |
| Classifier | Classifier class that holds all parameters and pointer to individual to which the parameters belong |
| ClassifierParams | Classifier data structure in XCS algorithm |
| Comm::Communicator | Communicator class for interprocess communication |
| Tree::Primitives::Cos | Cos function primitive (Tree genotype) |
| cart::Cos< T > | |
| Crossover | Crossover class - handles crossover of _individuals_ (as opposed to CrossoverOp class that crosses genotypes) |
| CrossoverOp | CrossoverOp base class |
| Deme | Deme class - inherits a vector of Individual objects |
| cart::Div< T > | |
| Tree::Primitives::DivT< T > | Div function primitive (Tree genotype) |
| Elimination | Elimination (generation gap) algorithm with roulette wheel elimination selection operatorThe algorithm flow: |
| Environment | Environment for the XCS algorithm |
| Tree::Primitives::ERC< T > | Ephemereal random constant (ERC) node class (Tree genotype) |
| Tree::Primitives::ERCD | Ephemereal random constant (ERC) node of type double (Tree genotype) |
| EvaluateOp | Evaluation base class |
| EvolutionContext | Evolutionary context class |
| Fitness | Fitness base class |
| FitnessMax | Fitness for maximization problems |
| FitnessMin | Fitness for minimization problems |
| FloatingPoint::FloatingPoint | FloatingPoint class - implements genotype as a vector of floating point values |
| FloatingPoint::FloatingPointCrsArithmetic | FloatingPoint genotype: offspring is defined as a linear combination of two vectors |
| FloatingPoint::FloatingPointCrsOnePoint | FloatingPoint genotype: one point crossover operator with permissible split. points only between dimensions |
| FloatingPoint::FloatingPointMutSimple | FloatingPoint genotype: simple mutation where each element has exactly equal chance of mutation. Mutated element is random value from the given domain |
| cart::Function | |
| FunctionMaxEvalOp | |
| FunctionMinEvalOp | Function minimization example - GA Binary or FloatingPoint genotype (see more on this example in help/tutorial.html) |
| cart::FunctionSet | |
| GeneticAnnealing | Genetic annealing algorithm (see e.g. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.7606, http://drdobbs.com/architecture-and-design/184409333?pgno=10) Currently implemented only for minimization problems! |
| Genotype | Genotype base class |
| HallOfFame | Records a set of best-so-far individuals |
| Individual | Individual class - inherits a vector of Genotype objects |
| Logger::Log | |
| Logger | Logging class - handles screen output and file logging |
| Tree::Primitives::MaxT< T > | Max function primitive (Tree genotype) |
| Migration | Migration class - handles individual migration between demes |
| Tree::Primitives::MinT< T > | Min function primitive (Tree genotype) |
| cart::Mul< T > | |
| Tree::Primitives::MulT< T > | Mul function primitive (Tree genotype) |
| Mutation | Mutation class - handles mutation of _individuals_ (as opposed to MutationOp class that mutates genotypes) |
| MutationOp | MutationOp base class |
| Tree::my_type | |
| Tree::MyFunc | |
| Tree::MyTerminal | |
| Tree::Primitives::NegT< T > | Neg function primitive (Tree genotype) |
| Tree::Node | Node base class (Tree genotype) |
| cart::Not< T > | |
| OneMaxEvalOp | OneMax example - GA BitString genotype (see more on this example in help/tutorial.html) |
| Operator | Abstract operator class |
| cart::Or< T > | |
| ParallelAlgorithm | Parallel algorithm base class.All parallel algorithms should inherit this one |
| ECF::Param | ECF parameter structure, as stored in the Registry |
| ParticleSwarmOptimization | Particle swarm optimization algorithm (see e.g. http://en.wikipedia.org/wiki/Particle_swarm_optimization)PSO algorithm accepts only a single Binary genotype. Additionally, it adds the following genotypes for algorithm implementation:
|
| Permutation::Permutation | Permutation class - implements genotype as a vector of indices (permutation of indices) |
| Permutation::PermutationCrsOX | Permutation genotype: OX crossover operator (see e.g. http://dx.doi.org/10.1016/j.amc.2007.10.013) |
| Permutation::PermutationCrsPBX | Permutation genotype: PBX crossover operator (see e.g. http://dx.doi.org/10.1016/j.amc.2007.10.013) |
| Permutation::PermutationCrsPMX | Permutation genotype: PMX crossover operator (see e.g. http://dx.doi.org/10.1016/j.amc.2007.10.013) |
| Permutation::PermutationMutIns | Permutation genotype: insert mutation operator (see e.g. http://dx.doi.org/10.1016/j.amc.2007.10.013) |
| Permutation::PermutationMutInv | Permutation genotype: inversion mutation operator (see e.g. http://dx.doi.org/10.1016/j.amc.2007.10.013) |
| Permutation::PermutationMutToggle | Permutation genotype: toggle mutation operator (see e.g. http://dx.doi.org/10.1016/j.amc.2007.10.013) |
| Population | Population class - inherits a vector of Deme objects |
| Tree::Primitives::PosT< T > | Pos function primitive (Tree genotype) |
| Tree::Primitives::Primitive | Base primitive class (Tree genotype) |
| Tree::PrimitiveSet | Primitive set class: collects all Tree Primitives |
| Randomizer | Abstract Randomizer class |
| RandomSearch | Random search algorithmThe algorithm flow: |
| Registry | Repository for all the system parameters |
| RouletteWheel | Generational algorithm with roulette wheel selection operatorThe algorithm flow: |
| SelBestOp | Best individual selection operator |
| SelectionOperator | Selection operator base class |
| SelFitnessProportionalOp | Fitness proportional (and inverse proportional) individual selection operator |
| SelRandomOp | Random individual selection operator |
| SelWorstOp | Worst individual selection operator |
| SimpleRandomizer | A simple randomizer that uses in-built random number generator |
| Tree::Primitives::Sin | Sin function primitive (Tree genotype) |
| cart::Sin< T > | |
| StatCalc | Statistics calculation class |
| State | State class - backbone of the framework |
| SteadyStateTournament | Steady state algorithm with tournament elimination operatorThe algorithm flow: |
| cart::Sub< T > | |
| Tree::Primitives::SubT< T > | Sub function primitive (Tree genotype) |
| SymbRegEvalOp | Symbolic regression example - GP Tree genotype (see more on this example in help/tutorial.html) |
| TermFitnessValOp | Termination operator: terminates on a given fitness value |
| Tree::Primitives::TerminalT< T > | Terminal tree node class (Tree genotype) |
| TermMaxEvalOp | Termination operator: terminates on a given number of fitness evaluations |
| TermMaxGenOp | Termination operator: terminates on a given number of generations |
| TermMaxTimeOp | Termination operator: terminates on a given elapsed time |
| TermStagnationOp | Termination operator: terminates when no improvement occurs in best individual for a given number of generations |
| Tree::Tree | Tree class - implements genotype as a tree |
| Tree::TreeCrxContextPreserved | Tree genotype: context presevation crx operator. Tries to make crossover at the 'same' point in both trees (with the same path from tree root node). Reference: http://dces.essex.ac.uk/staff/rpoli/gp-field-guide/53GPCrossover.html#11_3 |
| Tree::TreeCrxOnePoint | Tree genotype: one point crx operator. Tries to select a crossing point in parent tree's common region. Reference: http://dces.essex.ac.uk/staff/rpoli/gp-field-guide/53GPCrossover.html#11_3 |
| TreeCrxSimple | Tree genotype: simple tree crossover operator. Reference: http://dces.essex.ac.uk/staff/rpoli/gp-field-guide/24RecombinationandMutation.html#7_4 |
| Tree::TreeCrxSimple | Tree genotype: simple tree crossover operator (with default 90% bias toward functional node) Reference: http://dces.essex.ac.uk/staff/rpoli/gp-field-guide/24RecombinationandMutation.html#7_4 |
| Tree::TreeCrxSizeFair | Tree genotype: size fair crx operator. Reference: http://dces.essex.ac.uk/staff/rpoli/gp-field-guide/53GPCrossover.html#11_3 |
| Tree::TreeCrxUniform | Tree genotype: uniform crx operator. Reference: http://dces.essex.ac.uk/staff/rpoli/gp-field-guide/53GPCrossover.html#11_3 |
| Tree::TreeMutGauss | Tree genotype: standard normal distribution noise mutation operator. Applicable only on ephemereal random constants (ERC) of type 'double' |
| Tree::TreeMutHoist | Tree genotype: mutation operator that replaces original tree with a randomly chosen subtree from the original tree |
| Tree::TreeMutNodeComplement | Tree genotype: complement node mutation operator. For the operator to succeed, the chosen primitive must have a defined complement |
| Tree::TreeMutNodeReplace | Tree genotype: node replacement mutation operator. Tries to replace the selected primitive with a different one with the same number of arguments |
| Tree::TreeMutPermutation | Tree genotype: permutation mutation operator |
| Tree::TreeMutShrink | Tree genotype: mutation operator that shrinks randomly chosen subtree |
| Tree::TreeMutSubtree | Tree genotype: subtree size-fair mutation operator. This is a 'standard' GP subtree mutation |
| TSPEvalOp | Traveling salesman (TSP) example - GA Permutation genotype (see more on this example in help/tutorial.html) |
| XCS | XCS classifier system |
| XCSParams | Parameters for the XCS algorithm |
| cart::Xnor< T > | |
| cart::Xor< T > |
1.7.1