The Travelling Salesman problem is one of the very main problems in Computer Science and Operations Research. It is used to evaluate the lowest cost of doing a work while covering the complete area. In this research article proposed work is a new approach which is simulated annealing and a genetic algorithm for solving Travelling Salesman Problem in order to gather the benefits of SA. Also it diminishes the time that GA spend fixed at local minima. The proposed algorithms tend to produce superior quality results in smallest amount of time.