中文说明： 遗传算法解决5种多旅行商问题（mtsp）的matlab程序分别为以下5中情况：1.从不同起点出发回到起点（固定旅行商数量）2.从不同起点出发回到起点（旅行商数量根据计算可变）3.从同一起点出发回到起点4.从同一起点出发不会到起点5.从同一起点出发回到同一终点（与起点不同）
English Description：
The matlab program of genetic algorithm to solve five kinds of multi traveling salesman problem (MTSP) is as follows: 1. Starting from different starting points and returning to the starting point (fixed number of traveling salesman); 2. Starting from different starting points and returning to the starting point (the number of traveling salesman can be changed according to calculation); 3. Starting from the same starting point and returning to the starting point; 4. Starting from the same starting point and not going to the starting point; 5. Starting from the same starting point and returning to the same ending point (and Different starting point)