DRAFS: A Routing Algorithm based on Distributed Food Sources using Ant Colony Optimization

Distribution in routing algorithms based on food sources is a critical issue and the desired result could not be achieved through the old algorithms. For this purpose, participation of all sources through balanced distribution has been made in this proposed algorithm. In this paper, an improved routing algorithm based on distributed food sources is presented using the ant colony optimization. DRAFS algorithm helps us find the shortest path in order that we can generate a competence function, with the help of index parameters, to provide an optimal solution compared with other algorithms. Observing the distance and time parameters in finding the optimal solution, we introduce a target function which is accompanied by an increase in the algorithm efficiency. Comparing DRAFS algorithm with the previous routing algorithms, we have enjoyed the ants’ collaboration mechanism that results in the ants with high efficiency guiding the ants with low efficiency. Consequently, an optimal quality is achieved in the algorithm compared with the existing solutions. Finally, these two techniques help us improve the efficiency and reliability of the algorithm and, in comparison with previous algorithms, provide a distributed food source to reduce time accessibility to the source in large datasets.