Hybrid ant colony algorithm for traveling salesman problem

被引：12

作者：

HUANG Lan ZHOU Chunguang and WANG KangpingCollege of Computer Science and Technology Jilin University Changchun China ^{[130012
]}

机构：

来源：

Progress in Natural Science | 2003年 / 04期

关键词：

hybrid ant colony algorithm; traveling salesman problem; combinatorial optimization;

D O I：

暂无

中图分类号：

O224 [最优化的数学理论];

学科分类号：

070105 ; 1201 ;

摘要：

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

引用

页码：57 / 61

页数：5