Proposta de um algoritmo simulated annealing para a roteirização periódica de veículos em uma empresa de coleta de resíduos sólidos

Abstract

Law No. 12,305 of August 2, 2010 had, among its consequences, the emergence of the market for private solid waste collection companies, such as the one analyzed in this study, which serves establishments not covered by municipal garbage collection service. In order to reduce travel, labor and maintenance costs, among others, a Simulated Annealing algorithm is proposed for the optimization of routes to visit the 356 collection points served by the company, routes planned within a week to multiple vehicles of homogeneous capacity. For the problem, capacity restrictions, working hours and the frequency of attendance to the points are considered. Using the relocation between routes as a neighborhood exploration mechanism and a structure based on the nearest neighbor heuristic to obtain the initial solution, the algorithm proved to be effective for route optimization, where paths with a global cost of 7% were found lower than those currently used to service these same points.