This research aims to study the tourist tram routing problem in Lamphun City, Thailand. Considered an application of the Travelling Salesman Problem (TSP), the distance data along all possible routes were gathered from Google Maps and Google Earth, including additional information provided by the city. First, the shortest distance between each pair of the tourist spots is determined. Then, the linear programming (LP) model for TSP is employed so as to find the best tourist tram route traversing through all planned tourist spots with minimum total distance. The solution obtained from this model is then compared with those from the nearest neighbor and the savings algorithms for TSP. The comparison shows that the optimal tram routes from the LP model and the savings algorithm are, though different, tied at the minimum total distance of 9,770 meters, reduced by 9.36% from the current 10,779-meter route. This optimal route is also better than the of 10,050-meter route obtained from the nearest neighbor algorithm.