|
|
The TSP programme is intended to solve Traveling Salesman Problems for symmetric and asymmetric networks. The TSP (Traveling Salesman Problem) is characterized in the following way that a certain number of nodes have to be visited at least once, whereby the tour starts and ends at a particular node. The total distance (or costs) of roundtrip shall be minimised. There are also additional problems in which all nodes must be visited, but the return to the starting node should not take place. Such tasks are called Open TSPs and can generally be divided into the following four types:
   
|