Combinatorial Optimization: Solution Methods of Traveling Salesman Problem

ABSTRACT: Traveling Salesman Problem has been one of the most interesting and challenging problem in the literature. It is include a large area in combinatorial optimization problem. A variety of Exact and Heuristic Algorithms are usable algorithms for solving TSP. Branch and Bound Algorithm is an exact algorithm that is developed for solving TSP type problems. Furthermore, Genetic Algorithm is one of the extensively algorithm within the Heuristic Algorithm. In this work, we looked into symmetric and asymmetric matrices to solve TSP. We used Genetic and Branch-and-Bound Algorithms as the solution methods to get the shortest path. Keywords: Traveling Salesman Problem, Heuristic Algorithm, Exact Algorithm, Branch and Bound Algorithm, Genetic Algorithm. ……………………………………………………………………………………………………………………………………………………………………………………………………………………