A Study and Performance Evaluation of Various Optimization Techniques for Travelling Salesman Problem
Gunjan Choudhary · International Journal for Research in Applied Science and Engineering Technology · 2019
The Travelling Salesman Problem is one of the most popular problems from the NP set. It is also one of the hardest too. The solution to this problem enjoys wide applicability in a variety of practical fields. Thus, it highly raises the need for an efficient solution for this NP Hard problem. Travelling salesman problem (TSP) is a combinatorial optimization problem. Travelling salesman problem is the most intensively studied problem in the area of optimization. But with the increase in the number of cities, the complexity of the problem goes on increasing. The Travelling Salesman Problem is one of the very important problems in Computer Science and Operations Research. It is used to find the minimum cost of doing a work while covering the entire area or scope of the work in concern. In this paper, we have solved Travelling Salesman Problem using three approaches that are Ant Colony Optimization, Genetic Algorithm Approach and The Hybrid Optimization Algorithm based on Genetic Algorithm and Ant Colony Optimization.