Abstract. The multiple Traveling Salesman Problem (mTSP) is the general type of TSP, in which at least one than one sales representatives can be utilized as a part of the arrangement set. The Constraint in the improvement undertaking is that every sales representative comes back to beginning stage at end of outing, heading out to a particular arrangement of urban areas in the middle of and with the exception of the first, every last city is gone to by precisely one sales representative. The thought is to scan for the briefest course that is the slightest separation required for every salesperson to go from the beginning area to individual urban areas and back to the area from where he has begun. It is an intricate NP-Hard issue and has different applications for the most part in the field of planning and steering. The measure of algorithm time to take care of this issue develops exponentially as number of urban areas builds thus, the meta-heuristic streamlining algorithms, for example, Genetic Algorithm (GAs) are should have been investigated. The objective of this paper is to discover different algorithms utilized as a part of writing to understand mTSP.