JCLEC examples

This tutorial consist on several examples that shows how to use JCLEC in the resolution of different problems. Several of them are basic examples (tutorial example 1, 2) , limited to use the JCLEC code to solve the problem. Other (tutorial examples 3, 4) are intermediate examples, where user must develop a few code to solve the outlined problem (a class that implements the IEvaluator interface or extends the AbstractEvaluator class). Finally, there are advances examples (tutorial examples 4, 5, ) where user develop code to solve the problem in a specialized manner. These last require more programming expertise and a deepest JCLEC knowledge.

1. Function optimization with BCGAs. In this example we use a binary-coded genetic algorithm to optimize the f(x) = 1+ x sin(10 x) function.
2. Function optimization with RCGAs. In this example we use a real-coded genetic algorithm to optimize the f(x) = 1+ x sin(10 x) function.
3. More function optimization with RCGAs (optimizing the Sphere function) In this example we use real encoded genetic algorithms to optimize the Sphere function.
4. Travelling Salesman Problem In this example we use a genetic algorithm to solve the travelling salesman problem.
5. The prisonner's dilemma In this example we use a binary encoded genetic algorithm to solve the prisonner's dilemma.
6. The knapsack problem In this example we use a binary encoded genetic algorithm to solve the 0/1 knapsack problem.
7. Symbolic regression In this example we use Koza genetic programming to solve a simple symbolic regression problem.