DocumentCode
1618412
Title
A Hybrid Algorithm of ACO and Delete-Cross Method for TSP
Author
Junqiang, Wu ; Aijia, Ouyang
Author_Institution
Coll. of Math., Phys. & Inf. Eng., Jiaxing Univ., Jiaxing, China
fYear
2012
Firstpage
1694
Lastpage
1696
Abstract
A hybrid ant colony algorithm (HACO) which is containing ant colony algorithm (ACO) and delete-cross method which is used to speed the convergence of local search is presented for the shortcoming that the convergence speed of ant colony algorithm (ACO) is a bit slow. The experiment results have indicated that HACO has better performance than six versions of ant colony algorithm (ACO) on searching the shortest paths, error and robustness in the test of typical TSPs.
Keywords
ant colony optimisation; computational complexity; directed graphs; search problems; travelling salesman problems; HACO; NP-complete problems; TSP; delete-cross method; hybrid ant colony algorithm; local search convergence; shortest path searching; traveling salesman problem; Industrial control; Ant colony optimization; Delete-cross; Hybrid algorithm; TSP;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Control and Electronics Engineering (ICICEE), 2012 International Conference on
Conference_Location
Xi´an
Print_ISBN
978-1-4673-1450-3
Type
conf
DOI
10.1109/ICICEE.2012.448
Filename
6322738
Link To Document