An ant colony algorithm based on clustering and partition optimization - 文章详情页

作者：

Ji, Jun-Zhong (Ji, Jun-Zhong.) (学者：冀俊忠) | Huang, Zhen (Huang, Zhen.) | Liu, Chun-Nian (Liu, Chun-Nian.)

收录：

EI Scopus PKU CSCD

摘要：

To　improve　the　computation　performance　of　Ant　Colony　System　for　solving　large　scale　Traveling　Salesman　Problems　(TSP),　a　new　algorithm　is　presented　in　this　paper.　It　adopts　a　set　of　multistage　strategies　to　look　for　an　optimal　solution.　The　analysis　for　computation　complexity　and　experimental　results　for　TSP　problems　demonstrate　that　the　proposed　algorithm　can　greatly　improve　the　speed　of　convergence　while　keeping　more　optimal　solutions.

关键词：

Traveling salesman problem Computational complexity Optimization Clustering algorithms

作者机构：

[ 1 ] [Ji, Jun-Zhong]Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology, Beijing University of Technology, Beijing 100022, China
[ 2 ] [Huang, Zhen]Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology, Beijing University of Technology, Beijing 100022, China
[ 3 ] [Liu, Chun-Nian]Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology, Beijing University of Technology, Beijing 100022, China

通讯作者信息：

电子邮件地址：

查看成果更多字段

成果类型
所属机构

所有年份指定年份从至