Title :
Discrete growth competitive ant algorithm and its convergence
Author :
Zhu, Gang ; Ma, Liang
Author_Institution :
Sch. of Electron. & Electr. Eng., Shanghai Second Polytech. Univ., Shanghai, China
Abstract :
In this paper, a growth competitive ant algorithm for solving TSP is presented. The proposed algorithm introduces a growth competitive rule of plants into the ant algorithm and gives analysis of convergence for the algorithm by using the random fixed point theory. The iterative process of finding solutions in the algorithm is the random compressive operator. The implemented algorithm is tested through series of typical problem instances. The simulation results show the efficiency and effectiveness of the algorithm.
Keywords :
competitive algorithms; convergence of numerical methods; fixed point arithmetic; iterative methods; travelling salesman problems; TSP; competitive rule; convergence analysis; discrete growth competitive ant algorithm; iterative process; random compressive operator; random fixed point theory; traveling salesman problem; Convergence; Programming; Zinc; Ant Algorithm; Convergence; Growth Competitive; TSP;
Conference_Titel :
Progress in Informatics and Computing (PIC), 2010 IEEE International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-6788-4
DOI :
10.1109/PIC.2010.5687426
