Ant Colony Optimization

Authors(1) :-Jethva Harikrishna

Ant colonies, and more generally social insect societies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organization. As a result of this organization, ant colonies can accomplish complex tasks that in some cases far exceed the individual capacities of a single ant. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing. They are also able to adapt to changes in the environment. “Ant Colony Optimization” is an algorithm which searches for the solution of the problem under consideration in the way similar to real ants. It tries to make use of real ant abilities to solve various optimization problems. In this report study of simple ant algorithms has been done. Also, as an example they are applied on famous Traveling Salesman Problem. Finally, some results are tabulated comparing these algorithms with other optimization heuristics.

Authors and Affiliations

Jethva Harikrishna
Department of Computer Engineering L. D. College of Engineering, Ahmedabad (Gujarat-India)

AOC, TSP, Ant Colony, ACS, MAS


Publication Details

Published in : Volume 1_ | Issue 1 | 2014
Date of Publication : 2014-12-25
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 12-18
Manuscript Number : IJSRSET14114
Publisher : Technoscience Academy

Print ISSN : 2395-1990, Online ISSN : 2394-4099

Cite This Article :

Jethva Harikrishna, " Ant Colony Optimization, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 1_, Issue 1, pp.12-18, -2014.
Journal URL :

Article Preview