The Travelling Salesman Problem (TSP) is a very old yet very popular and highly researched topic. This problem has numerous solution paths, but to find the path with the least distance, we would have to check the combination of all different paths but that would increase the time to achieve the result. So, in our quest to solve the problem, we try to optimize the algorithms to give the best output that is the shortest path in the least number of iterations. There are various techniques to solve the Travelling Salesman Problem of which we will be using the two most popular techniques that are Particle Swarm Optimization (PSO), and Simulated Annealing (SA). In this paper, we perform a comparative analysis of these two algorithms on the basis of a number of iterations required to reach the optimum path. We have implemented the algorithms in Matlab, and run these algorithms on multiple sets of inputs and various number of inputs in each set. We will be comparing on the basis of number of iterations required for reaching the optimum solution. © BEIESP.