Simulated Annealing (SA) is the oldest probabilistic meta-heuristic algorithm and one of the first algorithms having ability to avoid being trapped in local minima. It is inspired by the process of annealing in metallurgy. In this process a m

Lin-Kernighan heuristic for the TSP and minimum weight perfect matching

Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.