Performance Analysis of Local Optimization Algorithms in Traveling Salesman Problem
Da Peng Qu, Hui Tu, Tie Sheng Fan · Advanced materials research · 2013
There are plenty of intelligence algorithms and heuristic algorithms for TSP (Traveling Salesman Problem). In this paper, local optimization algorithm which is a good representative of heuristic algorithms was analyzed. The performance of 2-opt (optimization), 3-opt and 4-opt were analyzed and compared through experiments. To reduce running time and improve their feasibility, a modification was made on 3-opt and 4-opt. Ant colony optimization as a good representative of intelligence algorithm was combined with k-opt to analyze. The results provide reference to application of k-opt and designing optimization algorithms for TSP in future.