A sequential approach for the optimization of truck routes for solid waste collection

The main objective of this paper is to present a sequential approach involving three phases for solving the optimization problem of truck routes for the collection of solid waste. The first phase executes the grouping of arcs based on an adapted model of the p-median problem, formulated as a problem of Binary Integer Linear Programming (BILP). The second phase refers to the development of a model for the solution to the Capacitated Arc Routing Problem (CARP), formulated as a Mixed Integer Linear Programming (MILP) problem. The third phase carries out the application of an adapted algorithm of Hierholzer for sequencing the arcs obtained in the preceding phase. The proposed methodology was tested using real data and efficiently solved the problem. The results led to a reduction in the distances traveled by trucks, which could promote money savings for the public coffers, as well as a reduction in carbon dioxide emissions.