CFP last date
20 May 2024
Reseach Article

Cluster Integrated Updation Strategies for ACO Algorithms

by Raghavendra G S, Prasanna Kumar N
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

@article{ 10.5120/3615-5033,
author = { Raghavendra G S, Prasanna Kumar N },
title = { Cluster Integrated Updation Strategies for ACO Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { September 2011 },
volume = { 30 },
number = { 2 },
month = { September },
year = { 2011 },
issn = { 0975-8887 },
pages = { 18-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume30/number2/3615-5033/ },
doi = { 10.5120/3615-5033 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:15:53.670951+05:30
%A Raghavendra G S
%A Prasanna Kumar N
%T Cluster Integrated Updation Strategies for ACO Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 30
%N 2
%P 18-24
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Dorigo,M., Maniezzo, V., and Colorni, A.(1996) Ant System: Optimization by a colony of cooperating agents, IEEE Transaction on Systems, Man and Cybernetics, Vol 26,No.1,pp.29-41.
  2. Bullnheimer, Hartl, R. F., and Strauss, C.(1999) A new rank based version of the Ant System: A computational study, Central European Journal for Operation Research and Economics, Vol 7,No.1,pp.25-38.
  3. Blum, C., Roli, A., and Dorigo, M.(2004) HC-ACO: The Hypercube framework for Ant Colony Optimization, IEEE Transaction on Systems, Man and Cybernetics, Vol 34,No.2,pp.1161-1172.
  4. Gambardella, L.M., and Dorigo, M.(1995) Ant-Q: A reinforcement learning approach to the traveling salesman problem. In Proceedings of 12th International Conference on Machine Learning.
  5. Gambardella, L.M., and Dorigo. M.(1997) Solving symmetric and asymmetric TSP by ant colonies. In Proceedings of IEEE International Conference on Evolutionary Computation. Porto,Spain.
  6. Stutzle, T., and Hoos, H.H.(2000) MAX - MIN Ant System, Future Generation Computer System, Vol 16,No 8,pp.889-914.
  7. Hong-hao, Z., and Fan-lun, X.(2006) A New Approach of Ant Colony Optimization and its Proof of Convergence. In Proceedings of 6th World Congress on Intelligent Control and Automation.
  8. Jun, S., Sheng-Wu and Fu-Ming, G.(2004) A New Pheromone Updating Strategy in Ant Colony Optimization. In Proceedings of 3rd International Conference on Machine Learning and Cybernetics.
  9. Lijie, L., Shangyou, J., and Ying, Z.(2008) Improved Ant Colony Optimization for the Traveling Salesman Problem. In Proceedings of International Conference on Intelligent Computation Technology and Automation.
  10. Masaya, Y., Masahiro, F., and Hidekazu, T.(2008) A New Pheromone Control Algorithm of Ant Colony Optimization. In Proceedings of International Conference on Smart Manufacturing Application.
  11. Naimi, H.M., and Taherinejad, N.(2009) New Robust and efficient ant colony algorithms: Using new interpretation of local updating process, Expert System with Applications, Vol 36,No.1,pp.481-488.
  12. Stutzle, T., and Dorigo, M.(2002) A Short Convergence Proof for a Class of Ant Colony Optimization, IEEE Transaction on Evolutionary Computation, Vol 20,No.3,pp.1-9.
  13. Raghavendra, G. S., and Prasanna K.N.(2008) Relative Reward Pheromone Update Strategy for ACO Algorithms. In Proceedings of MSAST2008, IMBIC,Kolkata,India.
  14. Blum, C.(2007). Ant Colony Optimization: Introduction and Hybridization. In Proceedings of 7th International Conference on Hybrid Intelligent Systems.
  15. MacQueen J (1967) Some methods for classification and analysis of multi-variate observations. In Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, pp.281-297.
  16. Prasanna, K., and Raghavendra, G.S.(2011) On the Evaporation Mechanism in the Ant Colony Optimization Algorithms, Annales of Computer Science Series, Vol 9,No.1,pp.51-56.
  17. Prasanna, K., and Raghavendra, G.S.(2011) A note on the Parameter of Evaporation Mechanism in the Ant Colony Optimization Algorithms, International Mathematical Forum, Vol 6,No.34,pp.1655-1659.
  18. Wang, W., Yang, J., Muntz, R (1997) STING: A Statistical information grid approach to spatial data mining. In Proceedings of International Conference on Very Large Databases, pp.186-195.
  19. Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Proceedings of the 6th International Conference on Genetic Algorithms, pp.184-192.
  20. Rui X, Donald W (2005) Survey of Clustering Algorithms. IEEE Transaction On Neural Networks, Vol.16,No 3,pp.645-678.
Index Terms

Computer Science
Information Sciences

Keywords

Ant Combinatorial Optimization Greedy Cluster