A comparative study of Travelling Salesman Problem and solution using different algorithm design techniques

This paper highlights the various solutions of the Travelling Salesman Problem. Hence, the comparative study of these solutions has been performed to conclude the methodology or algorithm which suits the problem most appropriately. In today's world, each process needs to be faster and quicker. So, the comparative study has been performed by taking the running time as the major criteria. The paper has a slight introduction along with the respective algorithms and their analysis and its inference.