This code is aimed at solving the multiple depots multiple traveling salesman problem by using genetic algorithm.Finding a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations). The salesmen originate a set of fixed locations, called depots.-This code is aimed at solving the multiple depots multiple traveling salesman problem by using genetic algorithm.Finding a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations). The salesmen originate　a set of fixed locations, called depots.