| dc.description.abstract | In general, the search for the shortest path can be divided into two methods, namely
conventional methods and heuristic methods. Conventional methods tend to be more
easily understood than the heuristic method, but more varied and heuristic methods
the computation time required is shorter. In the heuristic method, there are several
algorithms, one of which ant algorithms. Ant algorithm is an algorithm that was
adopted from the behavior of ant colonies. Ant colonies naturally able to find the
shortest path on the way from nest to food sources based on a path of footprints that
have been passed. The more ants that pass through a lane, it will be more clearly ex footprint. Ant algorithm is used to apply the proper completion of the optimization
problem, one of which is to determine the shortest path. | en_US |
