Brute Force Algorithm Application For Solving Traveling Salesman Problem (TSP) In Semarang City Tourist Destinations

This research applies the brute force algorithm to address the Traveling Salesman Problem (TSP) in the city of Semarang. It involves location and distance data from Google Maps, and a Python program is implemented to find the shortest and longest routes among Dusun Semilir, Cimory on The Valley, Rawa Pening, Gedong Songo Temple, Marina Beach, Semarang Old Town, Sam Poo Kong Temple, Lawang Sewu, Rainbow Village, Ranggawarsita Museum, and Simpang Lima. The results show that the shortest route from Marina Beach to Gedong Songo Temple is 72.1 km, while the longest route from Sam Poo Kong Temple to Rainbow Village reaches 300 km. The analysis strengthens the effectiveness of the brute force algorithm, although time complexity remains a major consideration. This research provides a foundation for further development and tackling more complex scenarios on larger datasets.