Data Structures and Algorithms

    

Exploring Solution Approaches for the Traveling Salesman Problem: From Heuristic Methods to Exact Algorithms

Authors: Shreyansh Vyas

This paper presents a comprehensive review of existing TSP (Travelling Salesman Problem) algorithms, followed by the introduction of a novel algorithm designed to efficiently provide optimal solutions within polynomial time. The proposed algorithm not only yields a lower bound on the TSP weight but also guarantees optimality under specific conditions. Through rigorous analysis and experimentation, this research contributes to advancing the field of TSP optimization by offering a reliable and scalable solution.

Comments: 10 Pages. In Russian (Correction made by viXra Admin - Please cite and list scientific references)

Download: PDF

Submission history

[v1] 2024-04-25 20:45:49

Unique-IP document downloads: 550 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus