5/4 approximation for Symmetric TSP

Travelling Salesman Problem (TSP) is one of the unsolved problems in computer science. TSP is NP Hard. Till now the best approximation ratio found for symmetric TSP is three by two by Christofides Algorithm more than forty years ago. There are different approaches to solve this problem. These range from methods based on neural networks, genetic algorithm, swarm optimization, ant colony optimization etc. The bound is further reduced from three by two but for graphic TSP. A factor of thirteen by nine was found for Graphic TSP. A newly proposed heuristic called 2 RNN is considered here. It seems from experimental results that five by four is the approximation ratio. Upper bound analysis for approximation ratio is done for this heuristic and it confirms experimental bound of five by four.