An Efficient Method for Solving Traveling Salesman Problem

Authors

  • Kalyan Kumar Mallick Department of Mathematics, University of Development Alternative (UODA), Dhaka, Bangladesh and Department of Mathematics, Jahangirnagar University, Savar, Dhaka, Bangladesh
  • Sushanta Kumer Roy Department of Mathematics, Jahangirnagar University, Savar, Dhaka, Bangladesh
  • Mollah Mesbahuddin Ahmed Department of Mathematics, Jahangirnagar University, Savar, Dhaka, Bangladesh
  • Md. Sharif Uddin Department of Mathematics, Jahangirnagar University, Savar, Dhaka, Bangladesh

Keywords:

Traveling Salesman Problem, Hungarian Method, Optimal Solution, Computer Algorithm

Abstract

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.

Published

2019-06-01

How to Cite

Kalyan Kumar Mallick, Sushanta Kumer Roy, Mollah Mesbahuddin Ahmed, & Md. Sharif Uddin. (2019). An Efficient Method for Solving Traveling Salesman Problem. Jahangirnagar University Journal of Science, 42(2), 15–26. Retrieved from https://jos.ju-journal.org/jujs/article/view/27

Issue

Section

Articles