Problem Multi-agent Traveler

In the M-TSP there are m traveling agents, who have to visit a finite number of places and each place must be visited exactly by an agent. Each seller starts in the same place, called a deposit, and you have to return to it at the end of your day.

The problem of the traveler for multiple travelers (mTPS), is to determine a set of routes for m sellers which leave from a vertex deposit city of origin and They return to him at the end of the route. The mTSP, in general, can be defined as follows:

Given a set of vertices, cities, where there is a deposit that is the origin city with m sellers located. The other vertices that are the cities must be visited by the sellers Then, the strategic plan consists of finding tours for all the vendors that start and end in the depot city, so that each intermediate vertex is visited only once and the total cost of visiting all the vertices is the minimum.