Shortest Path Search Simulation on Busway Line using Ant Algorithm

Abstract

Busway lane must be planned carefully, so that it can reach a number of points in an area efficiently. Problem that occurs is how to find the shortest route in a busway lane, this problem can be solved by using Ant algorithm. Naturally, ant colony will be able to find the shortest path on their way from nest to food sources by using pheromone. The Ant algorithm procedure to find shortest path in this research is using 100 ants to track all the path in a busway lane, drop pheromone on each path, the shorter a path is, the more pheromone gets accumulated on the path, and pheromone evaporates in each iteration. After going through a number of iterations, the pheromone will accumulate on the shortest path and all ants will follow the shortest path. Application can be used to find the shortest path from a busway lane planning in Medan using Ant algorithm. For a maximum of 30 terminals, ant algorithm requires only about 28 seconds to find the shortest route.