The Traveling Salesman Problem (TSP) is the subject of study in operational research for more than 30 years. The TSP is considered as 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. Academicians can focus on developing new methodologies without concerning the availability and correctness of reported algorithms in the literature. Practitioners may also benefit from provided transparency by our software solution and build their own customized packages to flourish their businesses. The proposed software can be a foundation for the future implementations in which users design their algorithm and results would be uploaded automatically on a public server together with the source code.