Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Innovative Science and Research Technology (IJISRT)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
