Ant Colony Optimization Algorithms: Introduction & its Recent Trends
Keywords:
Shortest Path Algorithms, Meta-heuristics, Ant Colony Optimization, Combinatorial Hard ProblemsAbstract
Ant Colony Optimization (ACO) algorithms be-long to the class of meta-heuristic approach to solve hard combinational optimization problems and were introduced in the 1990’s. The exhilarating source of ant colony optimization is the foraging demeanor of the real ant colonies. This demeanor of ants is exploited in artificial ant colonies for the search of comparative solutions to discrete optimization problems. ACO algorithms were given by DiCaro & M.Dorigo, in the year 1996. This paper is a review of Ant Colony Optimization with its algorithms in horological order with its recent trends.
References
- Najme Zehra Naqvi, Harmeen Kaur Matheru, “Review Of Ant Colony Optimization Algorithms On Vehicle Routing Problems”, 2011, International Conference on Environment Science and Engineering IPCBEE vol.8 (2011), © (2011) IACSIT Press, Singapore
- Anirudh Shekhawat Pratik Poddar Dinesh Boswa, “Ant colony Optimization Algorithms : Introduction and Beyond”, Indian Institute of Technology Bombay
- K. R. Hole, R. A. Meshram, P. P. Deshmukh, “Review: Applications of Ant Colony Optimization”, International Journal Of Engineering And Computer Science ISSN:2319-7242
- Gurpreet Singh, “A Review of Ant Colony System Algorithm and its Models”, International Journal of Advanced Research in Computer Science, © 2015-19, IJARCS All Rights Reserved
- Christian Blum, “Ant colony optimization: Introduction and recent trends”, Physics of Life Reviews 2 (2005) 353–373, © 2005 Elsevier B.V. All rights reserved, doi:10.1016/j.plrev.2005.10.00
Downloads
Published
Issue
Section
License
Copyright (c) IJSRST

This work is licensed under a Creative Commons Attribution 4.0 International License.