The goal is to find the shortest cycle in a complete graph of N no des. The nodes represent cities that are visited by a salesman.
For problem info, chromosome representation, quality-functions and applet-parameters: see (standard) ES Salesman Applet.