中文说明：常规的TSP问题是一个旅行商遍历，若是多旅行商问题又该如何求解呢。本算法针对多旅行商问题，基于遗传算法求解此问题。对算法有研究的可以从此代码中或多或少学到东西
English Description：
The conventional TSP problem is a traveling salesman traversal. If it is a multi traveling salesman problem, how to solve it. This algorithm is based on genetic algorithm to solve multi traveling salesman problem. Those who study algorithms can learn more or less from this code