LogisticsLab/TSP

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:

  • Open TSP with fixed start and destination nodes,
  • Open TSP with fixed start node and free destination node,
  • Open TSP with fixed destination node and free starting node,
  • Open TSP without specified start and destination node.
With TSP, various variants of the symmetric or asymmetric Traveling Salesman Problems or Open TSP in full as well as incomplete graphs can be solved using heuristic solution methods.

GUI TSP

GUI TSP

GUI TSP

GUI TSP