运用2-opt算法解决TSP（旅行商问题），满足自定义五个点及自设迭代次数，包括可视化结果。(TSP (Traveling Salesman Problem) is solved by using 2-opt algorithm, which satisfies five custom points and self-designed iteration times, including visualization results.)