Transition Matrices of Multiple Traveling Salesman Problem under the Action of The Dihedral Group


The idea behind this research is that the symmetric group on n letters or any permutation in S_n is a natural setting in which to build and study metaheuristic method applied permutation problems... In [1] they studied the transition matrices of 1-TSP (the traveling salesman of one agent) under the action of conjugation class, in [14] they generalized this result for m-TSP (the traveling salesman problem of multi agent), in [15] they studied the transition matrix of 1-TSP but under the action of the Dihedral group, in this paper we study and generalized this result for m-TSP.