Abstract: The Traveling Salesman Problem (TSP) is a classical combinatorial optimization problem whose complexity grows rapidly with problem size, making it difficult to solve efficiently using exact ...