The GA package
This package provides a framework for working with genetic algorithms. A genetic algorithm is an evolutionary technique, inspired by biological evolution, to evolve entities that perform as good as possible in terms of a predefined criterion (the scoring function). Note: lower scores are assumed to indicate better entities. The GA module provides a type class for defining entities and the functions that are required by the genetic algorithm. Checkpointing in between generations is available, as is automatic restoring from the last available checkpoint.
Properties
| Versions | 0.1, 0.2, 1.0 |
|---|---|
| Dependencies | base (4.*), directory, random |
| License | BSD3 |
| Copyright | (c) 2011 Kenneth Hoste |
| Author | Kenneth Hoste |
| Maintainer | kenneth.hoste@gmail.com |
| Stability | Experimental |
| Category | AI, Algorithms, Optimisation |
| Home page | http://boegel.kejo.be |
| Bug tracker | mailto:kenneth.hoste@gmail.com |
| Source repository | git clone git://github.com/boegel/GA.git |
| Upload date | Wed Aug 31 21:46:16 UTC 2011 |
| Uploaded by | KennethHoste |
| Built on | ghc-7.2 |
Modules
Downloads
- GA-0.1.tar.gz (Cabal source package)
- package description (included in the package)