International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 30 - Number 2 |
Year of Publication: 2011 |
Authors: Raghavendra G S, Prasanna Kumar N |
10.5120/3615-5033 |
Raghavendra G S, Prasanna Kumar N . Cluster Integrated Updation Strategies for ACO Algorithms. International Journal of Computer Applications. 30, 2 ( September 2011), 18-24. DOI=10.5120/3615-5033
Ant Colony Optimization (ACO) algorithm has evolved as the most popular way to attack the combinatorial problems. The ACO algorithm employs multi agents called ants that are capable of finding optimal solution for a given problem instances. These ants at each step of the computation make probabilistic choices to include good solution component in partially constructed solution, so that better solution can be obtained in the search process. The ant algorithms are typically characterized by co-operation among the ants, greedy, heuristics and feedback approaches that helps them to achieve their goals. In this paper, we propose new updation mechanism based on clustering techniques, which is aimed at exploring the nearby solutions region. We also report in detail the impact on performance due to integration of cluster and ACO.