T - IfB

Travelling SalesmanMake local changes: Define close configuration on SN : S 2 S with i N(j) j N(i)(i)´ N() j i j(j) ´iTraditional optimization algorithm:Improove systematically the costs by exploring close solutions.If F(σ´) < F(σ) replace σ σ ´ until F(σ) F(t) for all t N(σ).Problem: One gets stuck in local minima.Travelling SalesmanSimulated annealing optimization algorithm:If F(σ´) < F(σ) replace σ σ ´If F(σ´) > F(σ) replace σ σ ´with probability exp(- F / T)with F= F(σ ´)-F(σ ) > 0T is a constant (like a temperature)Go slowly to T 0 in order to find global minimum.67Applet68