This paper presents a polynomial dynamic programming based algorithm for solving M (M > 1) travelling salesman problem (TSP) on a directed bandwidth-limited graph, where the number of cities to be visited by each of the M travelling salesmen is specified.