ANT COLONY HEURISTICS APPLIED TO EMERGENCY LOGISTICS

This paper proposes the application of the Traveling Salesman Problem with Bonus (TSP-B) as a mathematical tool to optimize the distribution of resources in emergency situations. The approach seeks to establish efficient routes, considering the minimization of the traveled distance and the maximization of the coverage of priority areas, which have greater bonuses. To this end, the Ant Colony Algorithm (ACO) was developed and adapted to solve this problem, in addition to testing and comparing the adaptation with another adapted algorithm, GRASP, applied to similar scenarios, o GRASP, applied to similar scenarios, which was surpassed in terms of solutions.