Traveling Salesman Problem (TSP) is a basic and one of the most important transportation problems in operational logistics. It is also known in the literature as a Chinese postman problem or single vehicle routing problem. TSP can be shortly described as follows. Vehicle starting from the selected city must visit a set of another cities exactly once and return to the starting city in such a way that the total distance of the route is minimized.
In this paper first mathematical formulation of decision problem is presented. Then solution strategies of TSP are shown with selected algorithms as examples. In the last part of article, a computational results of selected methods are presented.