An Improved PSO-ACO Algorithm for Solving Large-Scale TSP
In this paper, an improved particle swarm optimization-ant colony algorithm (PSO-ACO) is presented by inserting delete-crossover strategy into it for the shortcoming which PSO-ACO can’t solve the large-scale TSP. The experiments results show that the PSO-ACO has better performance than ant colony algorithm (ACO) on searching the shortest paths, error and robustness for the TSP.
H. Wang, B.J. Zhang, X.Z. Liu, D.Z. Luo, S.B. Zhong
A. J. Ouyang and Y. Q. Zhou, "An Improved PSO-ACO Algorithm for Solving Large-Scale TSP", Advanced Materials Research, Vols. 143-144, pp. 1154-1158, 2011