Approximate backbone subsection optimization algorithm for the traveling salesman problem

Abstract

Approximate backbone subsection optimization algorithm is proposed to solve the traveling salesman problem, for the precision accuracy of the basic ant colony algorithm for solving the larger traveling salesman problem is low. First, traveling salesman problem approximate backbone is obtained by the ant colony algorithm, and then the original traveling salesman problem is sectioned based on the approximate backbone. Then the ant colony optimization algorithm is applied to solve the subsections to improve the precision accuracy of the global optimal solution. The experimental results show that the algorithm is more precision accuracy than the basic ant colony algorithms in the solution of the typical traveling salesman problem.