The Traveling Salesman Problem (TSP) which is a theoretical computer science and operations research problem, has several applications even in its purest formulation, such as the manufacture of microchips, planning, and logistics. There are many methods proposed in the literature to solve TSP with gains and losses. We propose a discrete metaheuristic method called D-PFA to solve this problem more efficiently. Initially, the Pathfinder Algorithm (PFA) was presented to handle issues involving continuous optimization, where it worked effectively. In recent years, there have been various published variants of PFA, and it has been frequently employed to address engineering challenges. In this study, the original PFA algorithm is broken into four sub-algorithms and every sub-algorithm is discretized and coupled to form a new algorithm. The proposed algorithm has a high degree of flexibility, a quick response time, strong exploration and exploitation. To validate the significant advantages of the proposed D-PFA, 34 different instances with different sizes are used in simulation results. The proposed method was also compared with 12 State-of-the-Art algorithms. Results indicate that the suggested approach is more competitive and resilient in solving TSP than other algorithms in different aspects. A conclusion and an outlook on future studies and applications are given at the end of the paper.