README
1+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
2
3Traveling Salesman Problem (tsp): Indices integer vector GA example
4
5Copyright (C) 2005
6by Christian Gagne <cgagne@gmail.com>
7and Marc Parizeau <parizeau@gel.ulaval.ca>
8
9+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
10
11
12Getting started
13===============
14
15 Example is compiled in binary 'tsp'. Usage options is described by
16 executing it with command-line argument '-OBusage'. The detailed help can
17 also be obtained with argument '-OBhelp'.
18
19Objective
20=========
21
22 Find a the shortest path to visit all the nodes of a randomly generated
23 graph.
24
25Representation
26==============
27
28 Order in which the nodes of the graph are visited. The integers in the
29 vector represent the indices of the nodes to visit.
30
31Fitness
32=======
33
34 Sum of the inter-node distance given the path represented by an integer
35 vector.
36
37