HYBRID ALGORITHM APPLICATION FOR ANT COLONIES
HYBRID ALGORITHM APPLICATION FOR ANT COLONIES

Summary/Abstract: In this day and age, most investors want to invest quickly in productive areas, although the risks they have to take are extremely high, but these are not the only disadvantages. This problem is a complex and difficult one. Exact resolution methods are limited to relatively small problems. This is why many approximate methods have been adapted to solve this problem. Among these adaptations we find algorithms based on metaheuristics. In this article, the problem is studied using the metheuristics of ant colonies. This is inspired by the collective behavior of deposition and tracking of traces observed in real ant colonies. The algorithm proposed by researchers is coupled with a local search algorithm that makes it possible to improve the solutions generated by ants. The execution of this algorithm is evaluated according to two factors: the quality of the solution and the calculation time. The purpose of this paper is to present the process of the algorithm. Moreover, another goal is to reveal some hybrid metaheuristics.

• Details
• Contents