This paper presents the implementation of an efficient modified genetic algorithm for solving the multi-traveling salesman problem (mTSP).The main characteristics of the method are the construction of an initial population of high quality and the implementation of several local search operators which are important in the efficient and effective exploration of promising regions of the solution space.Due to the combinatorial complexity of mTSP, the proposed methodology is especially applicable for real-world problems.The proposed algorithm was tested on a set of six benchmark instances, which have from 76 and 1002 cities to be visited.In all cases, the best known solution was improved.The results are also compared with other existing solutions procedure in the literature.