A method for optimizing waste collection using mathematical programming: a Buenos Aires case study
2012, Waste Management & Research 30 (3), 311-324, 2012Citas: 82
Agregar PDF Importar citas Importar citas SCRAPME Plots Conexiones
Autor(es)
Flavio Bonomo and Guillermo Durán and Frederico Larumbe and Javier Marenco
Abstract
A method is proposed that uses operations research techniques to optimize the routes of waste collection vehicles servicing dumpster or skip-type containers. The waste collection problem is reduced to the classic travelling salesman problem, which is then solved using the Concorde solver program. A case study applying the method to the collection system in the southern zone of Buenos Aires is also presented. In addition to the typical minimum distance criterion, the optimization problem incorporates the objective of reducing vehicle wear and tear as measured by the physics concept of mechanical work. The solution approach, employing graph theory and mathematical programming tools, is fully described and the data correction process is also discussed. The application of the proposed method minimized the distance travelled by each collection vehicle in the areas studied, with actual reductions ranging from …