(Created page with "The '''Traveling Salesman Problem (TSP)''' is a classical problem in optimization, being used often as a way to test new approaches. ==== Problem Definition ==== The TSP can...")
The Traveling Salesman Problem (TSP) is a classical problem in optimization, being used often as a way to test new approaches.
The TSP can be defined as: given a set of cities and the cost to travel between each pair, the aim is to find the way to visit all of the cities once and returning to your starting point, that minimizes the sum of the costs. The problem can be generalized to a graph where cities are the nodes and the costs represent the weights of the edges.
More information: see for instance 
The Traveling Salesman Problem (TSP) is addressed using Evolutionary Algorithms (EAs) with permutation representations.
The implementation of this problem can be found in the package test/tsp, that contains two sub-packages:
(e.g. euclidian, geometrical, symmetrical and asymmetrical).
Regarding this last sub-package the following classes are included:
(for more details see the how to: creating an evaluation function.