期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2013
卷号：2
期号：2
页码：359-361
出版社：Shri Pannalal Research Institute of Technolgy
摘要：Ant colony algorithm is an intelligent algorithm and is inspired by the behaviour of ants. Ants are blind and have the ability to find the shortest path from their colony to the food source. Using the capabilities of ants, ant colony algorithm solves combinatorial optimization problems which are hard problems such as TSP, 0-1 knapsack, graph colouring and so on. Ants solve their problem by cooperation using indirect communication or pheromone. Ants put pheromone on the ground while walking and each ant like better to follow a direction where amount of pheromone is high. When ants explored the shortest path which is blocked by an obstacle, each ant tries to find new shortest path. If an ant found the shortest path, it lays pheromone on the path, thus marking that path by a trail of its pheromone. The function of this trail is to guide other ants towards that path, reinforcing it with their pheromone and makes that path, the best path. Intensity of pheromone becomes higher on the shortest path. Pheromone evaporates on the longest path, thus reducing the intensity of pheromone. One of the problems of ant colony algorithm is stagnation behaviour in which all ants traverse the same path. Another problem is that it consumes more searching time to get better solutions. A large number of ants are required to avoid this situation.
