多旅行商问题的遗传算法 环形 固定节点- MTSPOFS_GA Fixed Start Open Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)

　　Finds a (near) optimal solution to a variation of the "open" M-TSP by

　　setting up a GA to search for the shortest route (least distance needed

　　for each salesman to travel from the start location to unique individual

　　cities without returning to the starting location)