Traveling salesman problem (TSP) is a typical NP complete combinatorial optimum problem.

• 摘要旅行商问题(TSP)是典型的NP完全组合优化问题。