The TSP program is used for solving Traveling Salesman Problems, Open Traveling Salesman Problems and Chinese Postman Problems for symmetrical and asymmetrical distances between the locations to be approached.

The TSP (Traveling Salesman Problem) is characterized by a certain number of nodes which have to be visited at least once, whereby the tour starts and ends at a particular node. The total distance (or travel times, 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.

LogisticsLab/TSP can be also used to solve Chinese Postman Problems in undirected, directed and mixed networks. Starting from a start node, each edge (directed or undirected) is to be traversed at least once and returned to the start node at the end of the round trip. The edge-oriented round trip to be found should minimise the total distance (or other adequate evaluation).

Distance Dialog TSP
Distances  TSP Optimisation Dialog TSP