说明：  应用GA算法搜索多旅行商问题的最短路径，得到最优解。每个旅行商只能访问一个城市一次，最后返回出发点。
(MTSP_GA Multiple Traveling Salesman Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the M-TSP 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))