跳到主要导航 跳到搜索 跳到主要内容

Hybrid ant colony algorithm based on scale compression

  • Northwestern Polytechnical University Xian
  • China Electronics Technology Group Corporation

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

2 引用 (Scopus)

摘要

To improve performance of ant colony algorithm when solving large-scale TSP problem, a hybrid ant colony algorithm based on scale compression is proposed. First we use genetic algorithm to generate a suboptimal solution set and calculate their intersection. By eliminating all cities mapped by the elements among the intersection in the primal TSP problem, we convert the original problem into a new one with smaller scale. In addition, we design a new optimal state transition rule based on regional characteristic of optimal solutions to accelerate convergence speed. Simulation results show our approach possess high searching ability and excellent convergence performance.

源语言英语
主期刊名Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007
页885-889
页数5
DOI
出版状态已出版 - 2007
活动6th International Conference on Machine Learning and Cybernetics, ICMLC 2007 - Hong Kong, 中国
期限: 19 8月 2007 → 22 8月 2007

丛书

姓名Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007
卷2

会议

会议6th International Conference on Machine Learning and Cybernetics, ICMLC 2007
国家/地区中国
市Hong Kong
时期19/08/07 → 22/08/07

学术指纹

探究 'Hybrid ant colony algorithm based on scale compression' 的科研主题。它们共同构成独一无二的学术指纹。

引用此