A method for optimizing waste collection using mathematical programming: a Buenos Aires case study
Authors:
- 1 April 2011
- journal article
- research article
- Published by SAGE Publications in Waste Management & Research: The Journal for a Sustainable Circular Economy
- Vol. 30 (3) , 311-324
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 10 to 40% of the existing routes. The shortened distances led in turn to substantial decreases in work done and therefore in vehicle wear and tear. Extrapolation of the results to the entire southern zone of Buenos Aires indicates potential savings for the civic authorities of more than US$200 000 per year in addition to the qualitative impacts of less traffic disruption, less vehicle driver fatigue and less pollution.Keywords
This publication has 10 references indexed in Scilit:
- Urban solid waste collection system using mathematical modelling and tools of geographic information systemsWaste Management & Research: The Journal for a Sustainable Circular Economy, 2009
- Waste collection vehicle routing problem with time windowsComputers & Operations Research, 2006
- Combining Simulation with Evolutionary Algorithms for Optimal Planning Under Uncertainty: An Application to Municipal Solid Waste Management Planning in the Reginonal Municipality of Hamilton-WentworthJournal of Environmental Informatics, 2003
- 10. Routing Vehicles in the Real World: Applications in the Solid Waste, Beverage, Food, Dairy, and Newspaper Industries2002
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problemEuropean Journal of Operational Research, 2000
- GIS Technology for Vehicle Routing and Scheduling in Solid Waste Collection SystemsJournal of Environmental Engineering, 1997
- Garbage Collection in Chicago: A Dynamic Scheduling ModelManagement Science, 1997
- Districting and Routing for Solid Waste CollectionJournal of the Environmental Engineering Division, 1978
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959