HSGEP-0.1.0: Gene Expression Programming evolutionary algorithm in Haskell Source code Contents Index

GEP.GenericDriver

Synopsis

type FitnessFunction a b = a -> b -> Double -> Double -> Double type ExpressionFunction a = Individual -> Genome -> a type TestCase a = SymTable a type TestDict a = [TestCase a] type TestOuts = [Double] gepDriver :: SimParams -> Rates -> Genome -> TestDict b -> TestOuts -> FitnessFunction a (TestCase b) -> ExpressionFunction a -> IO (Double, [String])

Documentation

type FitnessFunction a b = a -> b -> Double -> Double -> Double Source

Fitness function type

type ExpressionFunction a = Individual -> Genome -> a Source

Function to express an individual into a list of ET structures

type TestCase a = SymTable a Source

A test case maps a list of terminals to float values

type TestDict a = [TestCase a] Source

A test dictionary is a set of test cases

type TestOuts = [Double] Source

The set of outputs expected for each entry in the test dictionary

gepDriver Source

:: SimParams Simulation parameters -> Rates Rates for genetic operators -> Genome Genome that individuals are drawn from -> TestDict b Test dictionary for fitness testing -> TestOuts Expected test results for test dictionary -> FitnessFunction a (TestCase b) Fitness testing function -> ExpressionFunction a String to ET expression function -> IO (Double, [String]) Return best individual fitness and population Generic driver to be called from specific GEP program instances in their main routine.

Produced by Haddock version 2.6.1