Abstract. The paper concerns a distribution network, where the fixed number of traveling salesmen start and end their route at the same point. Their purpose is to visit every point exactly once. We wish to find exactly k cities assigned to every salesman. It is assumed that both capacity of vehicles and the size of all packages are irrelevant. We seek a solution, which minimizes a total distance by a fleet. The presented method takes advantage of effective already constructed algorithms for sTSP. The paper recalls both the (n+m-1) transformation from TSP to MTSP and the 2n transformation from asymmetric to symmetric problem.