Approximate Backbone Subsection Optimization Algorithm for the Traveling Salesman Problem
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.
KeywordsTraveling salesman problem Approximate backbone Subsection Ant colony optimization
This work was supported by the National Natural Science Foundation of China (No. 61763019), the Natural Science Foundation of Heilongjiang Province (General Program:F2017019), the “Thirteenth Five-Year Plan” of Education Science in Jiangxi Province for 2017 (No.17YB211), and the Science and Technology Plan Projects of Jiangxi Provincial Education Department (No. GJJ161072, No. GJJ161076, No. GJJ170 953).
- 6.Zhang, W.X., Looks, M.: A novel local search algorithm for the traveling salesman problem that exploits backbones. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 343–348. Morgan Kaufmann Publishers, San Francisco (2005)Google Scholar
- 15.Xu, K., Lu, H., Cheng, B., Huang, Y.: Ant colony optimization algorithm based on improved pheromones double updating and local optimization for solving TSP. J. Comput. Appl. 37(6), 1686–1691 (2017)Google Scholar
- 16.Zhang, C., Tu, L., Wang, J.: Application of self-adaptive ant colony optimization in TSP. J. Central South Univ. (Sci. Technol.) 46(8), 2944–2949 (2015)Google Scholar