O problema do carteiro chinês aplicado na otimização de rotas usadas na coleta de lixo reciclável: um estudo de caso

Abstract

The chinese postman problem is characterized as all the routing in the arcs graph which creates at least one rout that passes through all arcs at least once. In this research, the algorithm of the Chinese Postman Problem was applied in the urban region of Matelandia/PR as a way to optimize the rout of a truck collecting recyclable solid waste. The study was divided in three parts based on different weekdays: Mondays, Tuesdays and Wednesdays; because each day had a different route. Using the results generated by the Chinese Postman Problem’s algorithm, the Fleury Algorithm found one route for each day. The utilization of these algorithms provided a good solution for the problem of route generation for collecting recyclable solid waste. In the study region where the Chinese Postman was applied, the gains were approximately 23,45%, 33,12% and 40,13% for Mondays, Tuesdays and Wednesdays respectively.