The document describes the development and testing of the Euclidean Travelling Salesman Platform (ETSP) to test heuristics for solving the Travelling Salesman Problem (TSP). It discusses the motivation, objectives, and requirements for ETSP. It also evaluates the performance of ETSP and compares the QSTSH heuristic tested on ETSP to a greedy nearest neighbor heuristic. The results show that QSTSH has better accuracy and efficiency than the greedy nearest neighbor approach.