Title :
Research on analysis of convergence of an adaptive Ant Colony Optimization Algorithm
Author_Institution :
Sch. of Comput. & Electron. Eng., Hunan Univ. of Commerce, Changsha, China
Abstract :
In order to improve the global ability of basic ACA(ant colony algorithm), a novel ACA algorithm which is based on adaptively adjusting pheromone decay parameter has been proposed, and it has been proved that for a sufficiently large number of iterations, the probability of finding the global best solution tends to 1. The simulations for TSP problem show that the improved ACA can find better routes than basic ACA.
Keywords :
optimisation; travelling salesman problems; TSP problem; adaptive ant colony optimization algorithm; global best solution; pheromone decay parameter; Algorithm design and analysis; Ant colony optimization; Business; Cities and towns; Convergence; Fluids and secretions; Heuristic algorithms; Intelligent systems; Knowledge engineering; Stochastic processes;
Conference_Titel :
Intelligent System and Knowledge Engineering, 2008. ISKE 2008. 3rd International Conference on
Conference_Location :
Xiamen
Print_ISBN :
978-1-4244-2196-1
Electronic_ISBN :
978-1-4244-2197-8
DOI :
10.1109/ISKE.2008.4730981
