Simulated Annealing — TSP

Finding near-optimal tours by probabilistic hill-climbing with decreasing temperature

Setup

Annealing

Tour length
Temperature T
Iterations0
Accepts0%
Simulated Annealing (Kirkpatrick et al 1983): accept worse solutions with probability e^{−ΔE/T}. As T→0, converges to greedy. Inspired by annealing in metallurgy — slow cooling finds lower energy states. 2-opt moves: reverse a segment of the tour.