A Convergence Proof for Ant Colony Algorithm
In this paper, a general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. Based on the two different conditions, some convergence properties for Ant Colony System (ACS) are presented. The global searching and convergence ability are improved by adoptively changing the lower pheromone bound. It is shown that ACS is guaranteed to find an optimal solution with probability.
Jifu Nong Long Jin
College of Mathematics and Computer Science Guangxi University for Nationalities Guangxi, Nanning, 5 Guangxi Research Institute of Meteorological Disasters Guangxi, Nanning, 530022, China
国际会议
三亚
英文
2024-2027
2009-04-24（万方平台首次上网日期，不代表论文的发表时间）