This paper presents a modified genetic algorithm (MGA) to solve the multiple traveling salesmen problem (MTSP). This is one of the most important extensions of the traveling salesman problem and has many applications in combinatorial optimization problems. This problem can be used to model many practical problems. Here, in order for the initial solutions to be of high quality and variety, these solutions of the genetic algorithm are generated by the elite ant system algorithm. In addition, at each run of the algorithm, a number of chromosomes are randomly selected to prevent the reduction of the diversity of the solutions, and finally two different mutation algorithms, each with a probability of 0.5 each, are used to improve the final solutions. The results obtained on several standard examples show the performance of the proposed algorithm compared to other meta-heuristic algorithms.
