In this paper we study a problem called truncated M-travelling Salesman Problem. ‘There are n cities and N = (1,2, … n). The distance d(i,j) between any pair of cities (i,j) is known. A subset with no cities of n cities has to be traveled by the M-salesman. The number of cities to be traveled by each salesman i is ni cities with ∑ni = no. A salesman has to visit only given number of cities in his tour.’ The problem is to find a feasible M-tour for no cities for the M-salesman with minimum total length. The selection of no cities from n cities is called truncation. There are nc possibilites in selecting no cities from n cities. For this problem a computer program is developed for the algorithm and is tested. It is observed that it takes less time for solving fairly high dimension problems also. For this problem the definition, notation and algorithm are illustrated with the help of a numerical example.
