A Hybrid Algorithm of ACO and Delete-Cross Method for TSP

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 indi...

Full description

Saved in:
Bibliographic Details
Published in2012 International Conference on Industrial Control and Electronics Engineering pp. 1694 - 1696
Main Authors Wu Junqiang, Ouyang Aijia
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2012
Subjects
Ant colony optimization
Delete-cross
Hybrid algorithm
Industrial control
TSP
Online AccessGet full text
ISBN1467314501
9781467314503
DOI10.1109/ICICEE.2012.448

Cover

More Information
Summary: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.
ISBN:1467314501
9781467314503
DOI:10.1109/ICICEE.2012.448