MODELO ACO PARA LA RECOLECCIóN DE RESIDUOS POR CONTENEDORES

aco is a metaheuristic inspired in the behavior of natural ant colonies to solve combinatorial optimization problems, based on simple agents that work cooperatively communicating by artificial pheromone trails. in this paper a model to solve the municipal waste collection problem by containers is presented, which applies a concept of partial collection sequences that must be joined to minimize the total collection distance. the problem to join the partial collection sequences is represented as a tsp, which is solved by an aco algorithm. based on the literature, algorithm parameters are experimentally calibrated and range of variations that represents good average solutions are recommended. the model is applied to a waste collection sector of the san pedro de la paz commune in chile, obtaining recollection routes with less total distance with respect to the actual route utilized and to the solution obtained by a previously developed approach.