Safe Haskell | None |
---|
Code representing a single step of the GEP algorithm resides here.
single step of fitness evaluation, selection and reproduction to make a new population
process includes:
- expression of individuals
- fitness evaluation
- filtration to eliminate individuals yielding impossible fitness values (infinite or NaN)
- preservation of best individual
- generation of roulette selection weights
- roulette selection of individuals
- perform mutation operator
- IS transposition
- RIS transposition
- Gene transposition
- 1Pt recombination
- 2Pt recombination
- Gene recombination
Author: mjsottile@computer.org
Documentation
:: [Chromosome] | List of individuals |
-> Genome | Genome |
-> SimParams | Simulation parameters |
-> Rates | Gene operator rates |
-> ExpressionFunction a | Expression function |
-> FitnessFunction a b | Fitness function |
-> TestDict b | Fitness inputs |
-> TestOuts | Fitness outputs |
-> Int | Maximum number of generations to test |
-> Double | Ideal fitness |
-> GEPMonad (Double, [Chromosome]) |