TSP是典型的NP完全问题，即其最坏情况下的时间复杂度随着问题规模的增大按指数方式增长，遗传算法可进行有效求解(TSP is a typical NP-complete problem, that is, the time complexity in the worst case increases exponentially as the scale of the problem increases, and the genetic algorithm can be effectively s