Diseño de un modelo matemático para optimizar las rutas de recorrido del proceso de recolección de desechos sólidos para el Cantón Valencia

Abstract

Executive Summary The optimal urban waste collection route for the canton of Valencia in the province of Los Ríos, Ecuador is presented. A version of the integer linear programming model is selected, known as the “traveling salesman problem”, in which the start and return points do not necessarily coincide. A prior quantitative and graphic analysis of the available data is carried out using the program for geographic information systems QGis and the Pandas library for data management in Python. A strategy is discussed in which the sector under study is divided into five collection groups, made up according to the algorithm known as “k-Means ”. The proposed solution shows to be adjusted to reality and, although it does not imply a substantive decrease in intra-urban routes, since the scale of the problem is very small, it does produce a decrease in operating costs of the order of 18.15 percent, compared with the current situation.