遗传算法计算多旅行商问题：多个商人从多个城市出发各自返回自己的出发城市。-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for three salesmen to travel　the start location to individual cities

and back to the original starting place)