DocumentCode :
2823288
Title :
On the Faster Ant Colony Optimization Algorithm
Author :
Bi, Yingzhou ; Ding, Lixin ; Lu, Jianbo
Author_Institution :
Dept. of Inf. Technol., Guangxi Teachers Educ. Univ., Nanning, China
Volume :
3
fYear :
2009
fDate :
14-16 Aug. 2009
Firstpage :
45
Lastpage :
49
Abstract :
The pheromone trails in ACO are used to reflect the ants´ search experience, so the quality of the pheromone is crucial to the success of ACO. The main factors affecting the quality of the pheromone include the strategy of updating the pheromone and the quality of the constructed solutions. In order to improve the constructed solutions, this paper presents a method to analyze the invalid components of the constructed solution, and then repair the invalid components with immunity operator. When the pheromone density on the components are updated according the improved solution, they will more exactly reflect the character of high quality solution, so it will speed the positive feedback procedure. We examine the algorithm with examples of TSP and gain promising result.
Keywords :
algorithm theory; optimisation; ant colony optimization algorithm; immunity operator; pheromone density; pheromone trails; positive feedback procedure; Ant colony optimization; Bismuth; Evolutionary computation; Feedback; Immune system; Information technology; Laboratories; Sections; Software algorithms; Software engineering;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Natural Computation, 2009. ICNC '09. Fifth International Conference on
Conference_Location :
Tianjin
Print_ISBN :
978-0-7695-3736-8
Type :
conf
DOI :
10.1109/ICNC.2009.77
Filename :
5363708
Link To Document :
بازگشت