Abstract: The Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem with applications in logistics, transportation, and network design. Traditional approaches, ...