TSP Solver using Constructive Method of Heuristic Approach

Abstract

The Traveling salesperson problem (TSP) is one of the problem in mathematics and computer science which had drown attention as it is easy to understand and difficult to solve. In this paper, we implemented a heuristic approach for TSP using constructive method which generates satisfactory results in asymptotically linear time. Earlier work consider complete graph as a input to TSP. TSP solver generated by proposed approach can work with non-complete graph as well as complete graph.