ALGORITHMS ARTIFICIAL BEE COLONY AND ANT COLONY TO DETERMINE THE SHORTEST PATH IN DIRECTED GRAPHS

Abstract

The shortest path problem is a problem that is often found in networks, transportation, communication, and so on which are presented in graphical form. Artificial Bee Colony Algorithm and Ant Colony Algorithm are some of the algorithms designed by researchers to solve the shortest path problem. The Artificial Bee Colony algorithm is an algorithm inspired by the social behavior of a bee colony where a bee can reach food sources by the nearest route, while the Ant Colony algorithm is adopted from the behavior of ant colonies that are able to find the shortest path on their way from the hive to the food source places. The application of Artificial Bee Colony and Ant Colony algorithms on directed graphs to determine the shortest path get the same results and the two algorithms will display the same route repeatedly. The application of ant colony algorithm is simpler compared to the artificial bee colony algorithm in the process. Keywords : Directed graph, shortest path, Artificial Bee Colony algorithm and Ant Colony.