Introduction - If you have any usage issues, please Google them yourself
We try Tabu search (tabu search) algorithm to solve the traveling salesman problem (TSP), the program can the location coordinates of randomly generated points can even take some (relatively easy to determine the result is good or bad) the circle. We use the following rules to run the program: Amnesty Rule: If the new solution is disabled, but the objective function value is less than a given value than the current optimal solution of the objective function, the acceptance of the new solution. Termination rules: 1. If, within a given number of iterations, the optimal solution of the objective function value remains unchanged termination 2, termination achieve a given maximum number of iterations. Candidate Generation Solutions: The experiment I took a random method of generating a candidate solution of some of the selected parameters: at each step of the iteration, bl n candidate solution retention (can also produce n (n-1)/2) taboos length take tl sqrt (n), the maximum number of