Resolution of CTSP based on improved ant colony algorithm

被引：0

作者：

Liu Chun-bo ^{[1
]}

Pan Feng ^{[1
]}

Yang Dan ^{[1
]}

机构：

[1] So Yantze Univ, Sch Commun & Control Engn, Wuxi 214122, Peoples R China

来源：

PROCEEDINGS OF THE 2007 CHINESE CONTROL AND DECISION CONFERENCE | 2007年

关键词：

ant colony algorithm; Chinese traveling salesman problem; Matlab;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The volatility rate of information element is changed adaptively in order to suppress positive feedback, expand feasible solution scope, and avoid algorithm's premature when ant colony algorithm is used in resolving the traveling salesman problem. The Matlab simulation experiment show that this algorithm has good discovering ability and provides theories for further real application.

引用

页码：869 / 872

页数：4