DocumentCode :
3050494
Title :
Ant colony optimization algorithm based on space contraction
Author :
Liu, Liqiang ; Ren, Haijiao ; Dai, Yuntao
Author_Institution :
Coll. of Autom., Harbin Eng. Univ., Harbin, China
fYear :
2010
fDate :
20-23 June 2010
Firstpage :
549
Lastpage :
554
Abstract :
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.
Keywords :
optimisation; ant colony optimization algorithm; building block sets; solution composition sets; space contraction transformation operations; Algorithm design and analysis; Ant colony optimization; Cities and towns; Design automation; Design engineering; Distributed control; Educational institutions; Feedback; Large-scale systems; Testing; Ant colony algorithm; Optimization; Space contraction;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information and Automation (ICIA), 2010 IEEE International Conference on
Conference_Location :
Harbin
Print_ISBN :
978-1-4244-5701-4
Type :
conf
DOI :
10.1109/ICINFA.2010.5512397
Filename :
5512397
Link To Document :
بازگشت