Finding Shortest Path in Routing Problem by Using Ant Colony Optimization

This paper presents an ant colony optimization approach to find the shortest path (SP) in the routing problem. The algorithm is used two different metrics (bandwidth and routing delay) to determine the optimal route path(best route). The proposed method is used to determine the optimal path from source to destination. Ant colony decision must be made under network current conditions, that Minimize delay and Maximum Bandwidth for each link (determine average of all links) to selected optimal link. This paper shows that the proposed algorithms exhibits a much better route optimality from source to destination.