This library implements a framework for an evolutionary algorithm. It aims at including different techniques from the area of evolutionary computation, such as genetic algorithms and genetic programming, in one framework. It is setup such that new projects can be implemented by adjusting only the necessary parts in the library.

This program was used in research on random constraint satisfaction problems. The code is based on work and ideas of Jan Paredis.

Used in research on random constraint satisfaction problems with the SAW-ing algorithm. The program is capable of testing quite a lot of different operators, parameters and algorithms. The only drawback is that for every test the program has to be recompiled. The package found in the downloads below is setup to do some specific experiments.

This application implements the Stepwise Adaptation of Weigths Algorithm (SAW) and can be used to run experiments on graph k-colouring instances created using the Graph Coloring Problem Generator of Joe Culberson.

For doing experiments on graph k-colouring with the Grouping Genetic Algorithm (GGA) as introduced by E. Falkenauer. For problem instances it uses the Graph Coloring Problem Generator by Joe Culberson.