遗传算法解决5种多旅行商问题（mtsp）的matlab程序

分别为以下5中情况：

1.从不同起点出发回到起点（固定旅行商数量）

2.从不同起点出发回到起点（旅行商数量根据计算可变）

3.从同一起点出发回到起点

4.从同一起点出发不会到起点

5.从同一起点出发回到同一终点（与起点不同）-5 kinds of genetic algorithms to solve multiple traveling salesman problem (mtsp) matlab program

5, respectively, the following situations:

1. Back to the starting point　a different starting point (TSP fixed amount)

2. Back to the starting point　a different starting point (TSP amount calculated variable)

3. Starting　the same starting point back to the beginning

4. Starting　the same starting point to the starting point is not

5. Starting　the same starting point back to the same end point (with different starting points)