International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 117 | Views: 202

M.Tech / M.E / PhD Thesis | Computer Science & Engineering | India | Volume 3 Issue 7, July 2014 | Rating: 6.2 / 10

Performance Analysis of Travelling Salesman Problem in Ant Colony Optimization in Wireless Sensor Networks

Nancy Goyal | Paramjeet Singh [3]

Abstract: Ant colony algorithm is a metaheuristic algorithm which uses nature for finding solutions. Ant colony algorithm, by its performing behavior we know ant performs a series of routes as followed by deposition of pheromones. It is one of the algorithms used in Swarm Intelligence. Other Swarm Intelligence algorithm performs operation on the basis of collection behavior of ants, insects, birds, flies and other animals etc. Ant colony algorithm is used in various types of application such as Vehicle routing problem, Maximum input output detection etc. Ant colony algorithm has been successfully used for solving travelling salesman problem over large number of years. While, it has some drawbacks slow convergence speed, easily sousing into local minimum. Our aim is to find most favorable path through shortest distance and number of interactions accurately and quickly to get improved efficient energy, by using improved Ant colony algorithm.

Keywords: Ant colony optimization, Travelling salesman problem, Wireless sensor network, Swarm intelligence, Euclidean distance

Edition: Volume 3 Issue 7, July 2014,

Pages: 2260 - 2263

How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link

Verification Code will appear in 2 Seconds ... Wait