The TS algorithm is an iterative he

The TS algorithm is an iterative heuristic algorithm used to solve combinatorial optimization problems. The initial idea of the algorithm appears in Hansen's SteepestsAeentMildestDescentlAgorithm; it was first introduced in detail by FredGlover. The principle of TS algorithm is very simple and ingenious, it is a local neighborhood search method. Any one can solve S Ren. There is a neighborhood N (S) associated with it that belongs to Ω, and any solution s ’in the neighborhood belongs to N (S), which can be obtained by a shift of the initial solution s. Generally speaking, the relationship between neighbors is symmetrical and mutual. In other words, if S ’is a solution in the neighborhood of S, then S is also a solution in the neighborhood