(pronounced "jay-gap") is a genetic algorithms component written in the form of a Java framework. It provides basic genetic mechanisms that can be easily used to apply evolutionary principles to problem solutions. JGAP version 3.01 adds grid functionality to the code base of release 3.0.
Genetic algorithms (GAs) are evolutionary algorithms that use the principle of natural selection to evolve a set of solutions toward an optimum solution. GAs are not only quite powerful, but are also very easy to use as most of the work can be encapsulated into a single component, requiring users only to define a fitness function that is used to determine how "good" a particular solution is relative to other solutions. Genetic Programs (GP) enhance GAs. They allow programmers to 'breed' dynamic programs instead of static chromosomes.
A grid hosts a server, one to many workers, and one to many clients. A client can send work requests to the server, which in turn splits the work and provides the workers with corresponding tasks. After a worker finished a task the result is sent back to the server, which finally sends each received result back to the requesting client. The package used for grid functionality is jcgrid
, another open source project.
Klaus Meffert for the JGAP team
Message was edited by: email@example.com