[2] Wahyuningsih S, Satyananda D, Hasanah D. Implementation of TSP-VRP variants for distribution problem[J]. Global Journal of Pure and Applied Mathematics, 12, 723-732(2016).

[5] Wang Z Q, Zhu X G, Han Q Y. Mobile robot path planning on parameter optimization ant colony algorithm[J]. Procedia Engineering, 15, 2738-2741(2011).

[10] Dorigo M, Maniezzo V, Colorni A. Ant system： Optimization by a colony of cooperating agents[J]. IEEE, 26, 29-41(1996).

[12] Helsgaun K. General k-opt submoves for the Lin-Kernighan TSP heuristic[J]. Mathematical Programming Computation, 1, 119-163(2009).

[14] Mahi M, Baykan Ö K, Kodaz H. A new hybrid method based on Particle Swarm Optimization， Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem[J]. Applied Soft Computing, 30, 484-490(2015).

[15] Gülcü Ş, Mahi M, Baykan Ö K et al. A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem[J]. Soft Computing, 22, 1669-1685(2018).

[16] Bentley J L. Fast algorithms for geometric traveling salesman problems[J]. ORSA Journal on Computing, 4, 387-411(1992).

[17] Dumitrescu A, Mitchell J S B. Approximation algorithms for TSP with neighborhoods in the plane[J]. Journal of Algorithms, 48, 135-159(2003).

[18] Wong L P, Low M Y H, Chong C S. Bee colony optimization with local search for traveling salesman problem[J]. International Journal on Artificial Intelligence Tools, 19, 305-334(2010).

[19] Twomey C, Stützle T, Dorigo M et al. An analysis of communication policies for homogeneous multi-colony ACO algorithms[J]. Information Sciences, 180, 2390-2404(2010).

[20] Reinelt G. TSP library[webpage], 1, 1(2013). http：//comopt.ifi.uni-heidelberg.de/software/TSPLIB95/