monkiefarm Documentation

1.0.0

This is the documentation for apemonkie, genetic algorithms. Apemonkie tries to be a generic genetic algorithm library. In this pariticular instance called monkiefarm, apemonkie is used as a graph bipartitioning algorhithm, an NP hard problem. BUT you can use apemonkie for many other things by customizing it's policies, which are;

• Input: (instance:parse_graph_fast): this defines an input function to load data and store it in a useable fashion
• Selection: (instance:truncation): This defines the selection function, which determines the successfull individuals
• Crossover: (instance:hamming_one_point): Defines how individuals should pass genetic material to offspring
• Mutant: (instance:simple_mutation): This would be the mutation function, which should change genetic material in a random fashion
• Evoluation: (instance:fast_cut_size): This policy determines how an individual should be evaluated to remain in the next generation; by tournament, by sparring etc.
• Gene: (instance:bit_string): this stores the information which represents an individual