Dynamic Local Search Algorithm for Solving Traveling Salesman Problem

Abstract — In this paper, developing a new local search approach based on 2-Opt operator and its implementation for TSP solution in SA algorithm (as a global search algorithm) is purposed. It is shown that more favorable results are expected by meaningful correlation between local search approach and global search algorithm in annealing process. In order to compare the performance of the proposed operator with the 2-Opt as a basic operator, 24 benchmarks of TSP is selected from TSPLIB and both algorithms are implemented for 20 times for solving these benchmarks. The results show the improvement of error average for about 27%. Keywords- TSP; Local search; 2-Opt; Global search; Simulated annealin