Examples

From jecoliwiki
Revision as of 16:02, 5 March 2013 by Jecoliadmin (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

A number of examples are provided to illustrate the main functionalities 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.
  • 0/1 Knapsacking - illustrates binary representations and several ways to handle constraints in EAs.
Personal tools