Traveling Salesman Problem — cooling schedule optimization
N = 20
T₀ = 80
α = 0.990
Temperature—
Tour length—
Best found—
Iteration—
Accept rate—
Orange = current tour. Dashed = best found. 2-opt moves: swap two edges. High T accepts bad moves (exploration); low T only accepts improvements (exploitation). Watch tour improving over cooling.