Among the most well-known and widely used heuristic methods for the Traveling Salesman Problem (TSP) is the local search with k-exchange neighbors, k-opt, and in particular the 2-opt. This paper explores further how Topological Data Analysis (TDA) can improve the performance of the 2-opt heuristics in solving the TSP.