Artículo
Bonomo, F.; Durán, G.; Larumbe, F.; Marenco, J. "A method for optimizing waste collection using mathematical programming: A Buenos Aires case study" (2012) Waste Management and Research. 30(3):311-324
Consulte la política de Acceso Abierto del editor
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. © The Author(s) 2012.
Registro:
| Documento: | Artículo |
| Título: | A method for optimizing waste collection using mathematical programming: A Buenos Aires case study |
| Autor: | Bonomo, F.; Durán, G.; Larumbe, F.; Marenco, J. |
| Filiación: | Departamento de Computación, FCEyN, Universidad de Buenos Aires, Buenos Aires, Argentina CONICET, Argentina Departamento de Matemática, FCEyN, Universidad de Buenos Aires Ciudad Universitaria, pab. I, 1428 Buenos Aires, Argentina Departamento de Ingeniería Industrial, FCFM, Universidad de Chile, Santiago, Chile Instituto de Ciencias, Universidad Nacional de General Sarmiento, Los Polvorines, Argentina |
| Palabras clave: | Environment; mathematical programming; TSP; vehicle routing; waste collection; Buenos Aires; Collection systems; Collection vehicles; Data corrections; Driver fatigue; Environment; In-vehicle; Mechanical work; Minimum distance; Optimization problems; Solution approach; Traffic disruption; Travelling salesman problem; TSP; waste collection; Wear and tear; Graph theory; Refuse collection; Research; Traveling salesman problem; Vehicle routing; Mathematical programming; automobile; graphical method; numerical method; optimization; pollution control; savings; traffic congestion; waste management; wear; algorithm; article; mathematical analysis; pollution; priority journal; sensitivity analysis; traffic and transport; travel; waste management; Argentina; Cities; Models, Theoretical; Refuse Disposal; Sensitivity and Specificity; Transportation; Argentina; Buenos Aires [Argentina] |
| Año: | 2012 |
| Volumen: | 30 |
| Número: | 3 |
| Página de inicio: | 311 |
| Página de fin: | 324 |
| DOI: | http://dx.doi.org/10.1177/0734242X11402870 |
| Título revista: | Waste Management and Research |
| Título revista abreviado: | Waste Manage. Res. |
| ISSN: | 0734242X |
| CODEN: | WMARD |
| Registro: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0734242X_v30_n3_p311_Bonomo |
Referencias:
- Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J., (2006) The Traveling Salesman Problem: A Computational Study, , Princeton, New Jersey: Princeton University Press
- Arribas, C., Blazquez, C., Lamas, A., Urban solid waste collection systems using mathematical modelling and tools of geographic information systems (2010) Waste Management & Research, 28, pp. 355-363
- Chang, N., Lu, H., Wei, L., GIS technology for vehicle routing and scheduling in solid waste collection systems (1997) Journal of Environmental Engineering, 123, pp. 901-933
- Dijkstra, E.W., A note on two problems in connexion with graphs (1959) Numerische Mathematik, 1, pp. 269-271
- Eisenstein, D.D., Iyer, A.V., Garbage collection in Chicago: A dynamic scheduling model (1997) Management Science, 43 (7), pp. 922-933
- Garey, M., Johnson, D., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, , San Francisco, CA: Freeman and Company
- Golden, B., Assad, A., Wasil, E., (2002) The Vehicle Routing Problem, pp. 245-286. , Toth P Vigo D, ed. Philadelphia, PA: SIAM
- Hart, P.E., Nilsson, N.J., Raphael, B., A formal basis for the heuristic determination of minimum cost paths (1968) IEEE Transactions on Systems Science and Cybernetics, 4, pp. 100-107
- Kim, B., Kim, S., Sahoo, S., Waste collection vehicle routing problem with time windows (2006) Computers and Operations Research, 33, pp. 3624-3642
- Kumar, R., Li, H., (1996) On A Symmetric TSP: Transformation to Symmetric TSP and Performance Bound, , Lexington KY: Department of Electrical Enginnering, University of Kentucky
- Lavigne, J., Desaulniers, G., Desrosiers, J., Soumis, F., (1997) Basic Modeling with GENCOL, , GERAD, Universite du Quebec a Montreal, GC-REF-002
- Liebman, J., (1975) A Guide to Models in Governmental Planning and Operations, , Gass S Sisson R, ed. Potomac, MD: Sauger Books
- Male, J., Liebman, J., Districting and routing for solid waste collection (1978) Journal of the Environmental Engineering Division, 1041, pp. 1-14
- Martin, O., Otto, S.W., Felten, E.W., Large-step Markov chains for the traveling salesman problem (1996) Complex Systems, 5, pp. 299-326
- Mourao, M.C., Almeida, M.T., Lower-bounding and heuristic methods for a refuse collection vehicle routing problem (2000) European Journal of Operational Research, 121 (2), pp. 420-434. , DOI 10.1016/S0377-2217(99)00045-4
- Yeomans, J., Huang, G., Yoogalingam, R., Combining simulation with evolutionary algorithms for optimal planning under uncertainty: An application to municipal solid waste management planning in the regional municipality of Hamilton-Wentworth (2003) Journal of Environmental Informatics, 2, pp. 11-30
Citas:
---------- APA ----------
Bonomo, F., Durán, G., Larumbe, F. & Marenco, J. (2012) . A method for optimizing waste collection using mathematical programming: A Buenos Aires case study. Waste Management and Research, 30(3), 311-324.http://dx.doi.org/10.1177/0734242X11402870
---------- CHICAGO ----------
Bonomo, F., Durán, G., Larumbe, F., Marenco, J. "A method for optimizing waste collection using mathematical programming: A Buenos Aires case study" . Waste Management and Research 30, no. 3 (2012) : 311-324.http://dx.doi.org/10.1177/0734242X11402870
---------- MLA ----------
Bonomo, F., Durán, G., Larumbe, F., Marenco, J. "A method for optimizing waste collection using mathematical programming: A Buenos Aires case study" . Waste Management and Research, vol. 30, no. 3, 2012, pp. 311-324.http://dx.doi.org/10.1177/0734242X11402870
---------- VANCOUVER ----------
Bonomo, F., Durán, G., Larumbe, F., Marenco, J. A method for optimizing waste collection using mathematical programming: A Buenos Aires case study. Waste Manage. Res. 2012;30(3):311-324.http://dx.doi.org/10.1177/0734242X11402870
