Hybrid ant colony algorithm for traveling salesman problem

作     者：HUANG Lan , ZHOU Chunguang and WANG Kangping(College of Computer Science and Technology, Jilin University, Changchun 130012, China) 

出 版 物：《Progress in Natural Science:Materials International》 (自然科学进展·国际材料(英文))

年 卷 期：2003年第4期

页      面：57-61页

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China (Grant No. 60175024)  and by Key Laboratory of Symbolic Computer and Knowledge Engineering  Ministry of Education 

主　　题：hybrid ant colony algorithm traveling salesman problem combinatorial optimization. 

摘      要：A hybrid approach based on ant colony algorithm for the traveling salesman problem is proposed, which is an improved algorithm characterized by adding a local search mechanism, a cross-removing strategy and candidate lists. Experimental results show that it is competitive tn terms of solution quality and computation time.