Please feel free to edit/rename the question...

Here's the problem:

     Given:
     - Set of n (n > 0) cities is to be traversed by m (m > 0) salesmens
     - Where all the salesmen:
         - Are positioned at the same starting city
         - Finish at a same destination (which different from starting city). 

     The problem is to determine m route such that all the salesmen have to:
     - Start from the starting city
     - Visits each city exactly once 
     - Return to the same destination with optimal traversal cost/distance (load balancing if possible). 

Details:

I am a beginner in this kind of problem. Have been reading a lot of paper but mostly "must be return to the same city".

What "kind" of problem is this?

How would you implement a solution for it?

Please help me with keywords or article( or a solution if possible)



Thank you in advance!