T - IfB

Simulated Annealing (SA)S. Kirckpatrick, C.D. Gelatt and M.P. Vecci, 1983SA is a stochastic optimization technique.Given a finite set S of solutionsand a cost function F: S Search a global minimum:s* S* { s S : F(s) F(t) t S }.Difficult when S is very big (like |S| = n!).65Travelling SalesmanGiven n cities σ i and the travelling costs c(σ i ,σ j ).We search for the cheapest trip through allcities.• S = { permutations of {1,..,n} }• F() = i=1..n c(σ i ,σ j ) für SFinding the best trajectory is a NP-complex problem,i.e. time to solve grows faster than any polynomial of n.66