A method for optimizing waste collection using mathematical programming: A Buenos Aires case study
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...
| Autores principales: | , , , |
|---|---|
| Publicado: |
2012
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0734242X_v30_n3_p311_Bonomo http://hdl.handle.net/20.500.12110/paper_0734242X_v30_n3_p311_Bonomo |
| Aporte de: |
| id |
paper:paper_0734242X_v30_n3_p311_Bonomo |
|---|---|
| record_format |
dspace |
| spelling |
paper:paper_0734242X_v30_n3_p311_Bonomo2023-06-08T15:44:02Z A method for optimizing waste collection using mathematical programming: A Buenos Aires case study Bonomo, Flavia Durán, Guillermo A. Larumbe, Federico Marenco, Javier Leonardo 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 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. Fil:Bonomo, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Durán, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Larumbe, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Marenco, J. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2012 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0734242X_v30_n3_p311_Bonomo http://hdl.handle.net/20.500.12110/paper_0734242X_v30_n3_p311_Bonomo |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
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] |
| spellingShingle |
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] Bonomo, Flavia Durán, Guillermo A. Larumbe, Federico Marenco, Javier Leonardo A method for optimizing waste collection using mathematical programming: A Buenos Aires case study |
| topic_facet |
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] |
| description |
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. |
| author |
Bonomo, Flavia Durán, Guillermo A. Larumbe, Federico Marenco, Javier Leonardo |
| author_facet |
Bonomo, Flavia Durán, Guillermo A. Larumbe, Federico Marenco, Javier Leonardo |
| author_sort |
Bonomo, Flavia |
| title |
A method for optimizing waste collection using mathematical programming: A Buenos Aires case study |
| title_short |
A method for optimizing waste collection using mathematical programming: A Buenos Aires case study |
| title_full |
A method for optimizing waste collection using mathematical programming: A Buenos Aires case study |
| title_fullStr |
A method for optimizing waste collection using mathematical programming: A Buenos Aires case study |
| title_full_unstemmed |
A method for optimizing waste collection using mathematical programming: A Buenos Aires case study |
| title_sort |
method for optimizing waste collection using mathematical programming: a buenos aires case study |
| publishDate |
2012 |
| url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0734242X_v30_n3_p311_Bonomo http://hdl.handle.net/20.500.12110/paper_0734242X_v30_n3_p311_Bonomo |
| work_keys_str_mv |
AT bonomoflavia amethodforoptimizingwastecollectionusingmathematicalprogrammingabuenosairescasestudy AT duranguillermoa amethodforoptimizingwastecollectionusingmathematicalprogrammingabuenosairescasestudy AT larumbefederico amethodforoptimizingwastecollectionusingmathematicalprogrammingabuenosairescasestudy AT marencojavierleonardo amethodforoptimizingwastecollectionusingmathematicalprogrammingabuenosairescasestudy AT bonomoflavia methodforoptimizingwastecollectionusingmathematicalprogrammingabuenosairescasestudy AT duranguillermoa methodforoptimizingwastecollectionusingmathematicalprogrammingabuenosairescasestudy AT larumbefederico methodforoptimizingwastecollectionusingmathematicalprogrammingabuenosairescasestudy AT marencojavierleonardo methodforoptimizingwastecollectionusingmathematicalprogrammingabuenosairescasestudy |
| _version_ |
1768541993398435840 |