Otimização de rotas dos caminhões de coleta de resíduos sólidos urbanos

• Ano de defesa: 2016
• Autor(a) principal: Vecchi, Thelma Pretel Brandão
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Estadual de Maringá; Brasil; Departamento de Engenharia Química; Programa de Pós-Graduação em Engenharia Química; UEM; Maringá, PR; Centro de Tecnologia
• Palavras-chave em Português: Engenharia química; Coleta de resíduos sólidos; Rotas; Otimização; Roteamento de veículos; Otimização de rotas; Problema de roteamento de veículos; Problema de roteamento em arcos capacitados; Brasil.; Route optimization; Vehicle routing problem; Capacitated arc routing problem; Solid waste collection; Brazil.; Engenharias; Engenharia Química
• Link de acesso: http://repositorio.uem.br:8080/jspui/handle/1/3664

The process of collecting municipal solid waste is important in modern society, but it consumes many resources of Brazilian municipalities. This work aims to develop a system that optimizes the collection routes carried by trucks. This optimization aims to reduce the distance traveled and the emission of pollutants from trucks. Mathematically, this is a combinatorial optimization problem that presents a large number of variables and constraints, which often hinders their solution. In this work it was developed two different approaches that involve mathematical modeling: first it was considered a model of Mixed Integer Linear Programming (MILP), known as a Vehicle Routing Problem (VRP) and classified as a Node Routing Problem (NRP). Then it was developed a sequential three-step approach. The first stage performs the grouping of the arcs (streets channel) that must be attended by the trucks, based on an adapted model of the P-median problem, a Binary Integer Linear Programming (BILP) problem. In the second phase applies a model for the Capacitated Arc Routing Problem (CARP), formulated as a problem of MILP and classified as an Arc Routing Problem (ARP). In the third phase, applies an algorithm that has been adapted from Hierholzer algorithm to obtain the itinerary of the vehicles. The two developed approaches have been applied to data from the central region of a Brazilian city with about 93,000 inhabitants, which allowed workable solutions, in good computational time. The results from the approach that uses the VRP allowed a reduction of approximately 32% in total distance traveled and a savings of about US$ 230.00 per day. The sequential approach was applied to two situations: undifferentiated collection of waste and selective collection. For undifferentiated collection, the results of the sequential approach allowed a reduction of 1.5% in total distance traveled and a savings of about US$ 3200.00/year. For the selective collection, the results of the sequential approach allowed a reduction of 7.5% in the total distance traveled and savings of approximately US$ 4000.00/year. The optimized routes from the sequential approach to the undifferentiated collection and to the selective collection also enable an annual reduction of pollutant emissions into the atmosphere by the collection trucks, of about: 780 gpoluttants of CO, 150 gpoluttants of NMHC, 1700 gpoluttants of NOx, 20 gpoluttants of PM (particulate material), 45 gpoluttants of CH4 and 915 kg of CO2.