说明：  通过建立一个GA来搜索最短路线（需要最短路程或推销员每个城市到达每个城市一次，并找到最接近的最佳解决方案），找到M-TSP（具有可变数量的推销员） 返回他们的起始位置）。
(Finds 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 or the salesmen to travel to each city exactly once and return to their starting locations).)