Introduction - If you have any usage issues, please Google them yourself
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 solved.