The Traveling Salesman Problem (TSP) is the subject of study in operational research for more than three decades. The TSP problem is NP-complete. Consequently, many heuristic and metaheuristic algorithms have been developed to cope with the intractable nature of the problem. Although the problem is well-studied, lack of integrated software that harnesses the new computers' computational power and provides an easy comparison between heuristic algorithms is sensible. TSP solver is the state-of-the-art software that provides a common framework to compare the performance of different algorithms over TSPLIB library. The widespread use of TSP and its benchmark library means that yield improvement can be significant. The proposed software can be a foundation for the future implementations in which users designs their algorithm and results would be uploaded automatically on a public server together with the source code.