An Efficient Method for Solving Traveling Salesman Problem
Keywords:Traveling Salesman Problem, Hungarian Method, Optimal Solution, Computer Algorithm
The traveling salesman problem (TSP) consists of a salesman and a set of cities. The salesman has to visit each one of the cities starting from a certain one (e.g. the home city) and returning to the same city. The challenge of the problem is that the traveling salesman wants to minimize the total length of the trip. In this paper, we introduce and analyze a variation of the Traveling Salesman problem.
The paper will cover algorithms for TSP to take the decision which optimizes the distance. Our proposed algorithm helps to determine the optimum distance with less number of iteration by easiest way and presents alternative method for solving the classical traveling salesman problem (TSP). Several numerical examples are solved to test the performance of the proposed method. The comparison of the result shows that proposed algorithm is efficient for solving the TSPs.
How to Cite
©2018 Jahangirnagar University Journal of Science. All rights reserved. However, permission is granted to quote from any article of the journal, to photocopy any part or full of an article for education and/or research purpose to individuals, institutions, and libraries with an appropriate citation in the reference and/or customary acknowledgement of the journal.