From jecoliwiki

A number of examples are provided to illustrate the main functionalities of JECoLi:

- Counting ones - this toy problem illustrates the basics of JECoLi.

- Travelling Salesman Problem - the eternal problem of the Travelling Salesman Problem illustrates EAs with permutation representations, memetic algorithms and how to do multiple runs of an algorithm.

- Function Optimization - illustrates numerical optimization with real value encoding with EAs, DE and SA

- 0/1 Knapsacking - illustrates binary representations and several ways to handle constraints in EAs.

- Multiobjective optimization - illustrates the use of Multi-Objective optimization EAs (MOEAs).

- Symbolic Regression - shows the use of Genetic Programming and also Linear GP.