Open AccessFinding the shortest path using the ant colony optimization
Author(s) -
K Yella Swamy,
Saranya Gogineni,
Yaswanth Gunturu,
Deepchand Gudapati,
Ramu Tirumalasetti
Publication year - 2017
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i1.1.9859
Subject(s) - ant colony optimization algorithms , shortest path problem , mathematical optimization , computer science , ant colony , path (computing) , artificial intelligence , mathematics , theoretical computer science , computer network , graph
An ant colony optimization(ACO) is a techniquewhich is recently introduced ,and it is applied to solve several np-hard problems ,we can get optimal solution in a short time Main concept of the ACO is based on the behavior of ants in their colony for finding a source of food. They will communicate indirectly through pheromone trails. Computer based simulation is can generate good solution by using artificial ants, by using that general behavior we are solving travelling Sale man problem.