Ant Colony Optimization Algorithm Based on Space Contraction

摘要：

According to the problem of slow running speed in ant colony algorithm, a space contraction ant colony optimization algorithm has been designed, through introducing space contraction transformation operations into standard ACS algorithm. The speed of the algorithm could be increased, because the algorithm integrates the building block of high concentration pheromone constantly. It could reduce the size of the solution composition sets and building block sets. The test results of algorithm performance show that, compared with ACS algorithm, the ant colony algorithm based on space contraction has faster speed. And the algorithm has better search ability than ACS algorithm, when solving large-scale optimization problems in discrete domain.

关键词： Ant colony algorithm Space contraction Optimization

作者: Liqiang Liu Haijiao Ren Yuntao Dai

作者单位: College of Automation Harbin Engineering University Harbin,150001,China College of Science Harbin Engineering University Harbin,150001,China

会议类型: 国际会议

会议名称: 2010 IEEE信息与自动化国际会议(ICIA 2010)

会议地点: 哈尔滨

会议语种:英文

页码: 1-6

在线出版日期: 2010-06-20（万方平台首次上网日期，不代表论文的发表时间）