Key points are not available for this paper at this time.
The Traveling Salesman Problem (TSP) is a combinatorial problem related to computer science and operations research. There are many methods proposed in the literature to solve TSP with profit and losses. In this classical problem, the objective is to visit a finite number of locations exactly once, one by one, while minimizing the total distance traveled by the connecting links (arcs) needed to reach these sites (nodes). This study presents a new procedure that applies TSP and makes use of the decision tree notion. Anywhere in the TSP network, where n is the total number of places (nodes) in the network, this system ends after n-1 iterations. The method's step-by-step computational criteria make it efficient and readily applicable. To demonstrate the process's validity and efficiency, numerical examples are provided.
Mallick et al. (2024) studied this question.