The Traveling Salesman Problem (TSP) asks for the shortest tour through N cities. 2-opt local search reverses segments to remove crossings; simulated annealing escapes local minima by accepting worse solutions with probability e^(−ΔL/T). Watch the tour progressively untangle as temperature cools.