API Reference Genetix v0.3.0
modules
Modules
Structure of a genetic algorithm in Elixir.
Contain functions with different aproaches / strategies to make the crossover. In genetic algorithms and evolutionary computation, crossover, also called recombination, is a genetic operator used to combine the genetic information of two parents to generate new offspring.
Contain functions with different aproaches to make the evaluation. Every problem has an objetive. The goal of optimization is to maximize or minimize a value.
Contains functions with different aproaches / strategies to make the mutation. Mutation is a genetic operator used to maintain genetic diversity of the chromosomes of a population of a genetic or, more generally, an evolutionary algorithm (EA). It is analogous to biological mutation.
Contain functions with different aproaches / strategies to make the reinsertion. Reinsertion is the process to takin chromosomes produced from selection, crossover, and mutation and inserting them back into a population to move on the next generation.
Contain functions with different aproaches / strategies to make the selection. Selection is the stage of a genetic algorithm or more general evolutionary algorithm in which individual genomes are chosen from a population for later breeding (e.g., using the crossover operator).
Genetic problem behaviour definition with the problem-specific functions that a problem must to provide
A specific genetic problem implementation for NQueens. The N Queen is a combinatorial optimization problem, the objective is to configure NQueens on chess board so that no queen theatens another.any()
A specific genetic problem implementation for OneMax. The One-Max problem is a trivial problem: What is the maximum sum of a bitstring (a string consisting of only 1s and 0s) of length N.
A specific problem implementation to obtain @target (a-z no whitespaces) string.
A specific genetic problem implementation for ZeroMax. The Zero-Max problem is a trivial problem: What is the minimum sum of a bitstring (a string consisting of only 1s and 0s) of length N.
Chromosome type definition that represents a single solution. A Chromosome represents one solution to the problem you are trying to solve. Solutions are encoded into a collection of genes. The Chromosome is then evaluated based on some criteria you define.
Genealogy tree server implementation. A genealogy tree is a directed grapgh that points from parent chromosome to child chromosome and shows the transitions of the evolution from first population to last population.
Statistics server implementation