An Improved PSO-ACO Algorithm for Solving Large-Scale TSP

Abstract:

Article Preview

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.

Info:

Periodical:

Advanced Materials Research (Volumes 143-144)

Edited by:

H. Wang, B.J. Zhang, X.Z. Liu, D.Z. Luo, S.B. Zhong

Pages:

1154-1158

DOI:

10.4028/www.scientific.net/AMR.143-144.1154

Citation:

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

Online since:

October 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.