A method for optimizing waste collection using mathematical programming: a Buenos Aires case study

Autores
Bonomo, Flavia; Duran, Guillermo Alfredo; Larumbe, Federico Daniel; Marenco, Javier Leonardo
Año de publicación
2011
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Duran, Guillermo Alfredo. Universidad de Chile; Chile. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Larumbe, Federico Daniel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Marenco, Javier Leonardo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina
Materia
Mathematical Programming
Waste Collection
Vehicle Routing
Tsp
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/21015
Acceder
id CONICETDig_7a4720122e6ad467f2cbe5cac19ebd32
oai_identifier_str oai:ri.conicet.gov.ar:11336/21015
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A method for optimizing waste collection using mathematical programming: a Buenos Aires case studyBonomo, FlaviaDuran, Guillermo AlfredoLarumbe, Federico DanielMarenco, Javier LeonardoMathematical ProgrammingWaste CollectionVehicle RoutingTsphttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1A 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.Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Duran, Guillermo Alfredo. Universidad de Chile; Chile. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Larumbe, Federico Daniel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Marenco, Javier Leonardo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; ArgentinaSage Publications2011-04info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/21015Bonomo, Flavia; Duran, Guillermo Alfredo; Larumbe, Federico Daniel; Marenco, Javier Leonardo; A method for optimizing waste collection using mathematical programming: a Buenos Aires case study; Sage Publications; Waste Management & Research; 30; 3; 4-2011; 311-3240734-242X1096-3669CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1177/0734242X11402870info:eu-repo/semantics/altIdentifier/url/http://journals.sagepub.com/doi/10.1177/0734242X11402870info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T10:03:43Zoai:ri.conicet.gov.ar:11336/21015instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 10:03:43.87CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A method for optimizing waste collection using mathematical programming: a Buenos Aires case study
title A method for optimizing waste collection using mathematical programming: a Buenos Aires case study
spellingShingle A method for optimizing waste collection using mathematical programming: a Buenos Aires case study
Bonomo, Flavia
Mathematical Programming
Waste Collection
Vehicle Routing
Tsp
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 A method for optimizing waste collection using mathematical programming: a Buenos Aires case study
dc.creator.none.fl_str_mv Bonomo, Flavia
Duran, Guillermo Alfredo
Larumbe, Federico Daniel
Marenco, Javier Leonardo
author Bonomo, Flavia
author_facet Bonomo, Flavia
Duran, Guillermo Alfredo
Larumbe, Federico Daniel
Marenco, Javier Leonardo
author_role author
author2 Duran, Guillermo Alfredo
Larumbe, Federico Daniel
Marenco, Javier Leonardo
author2_role author
author
author
dc.subject.none.fl_str_mv Mathematical Programming
Waste Collection
Vehicle Routing
Tsp
topic Mathematical Programming
Waste Collection
Vehicle Routing
Tsp
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv 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.
Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Duran, Guillermo Alfredo. Universidad de Chile; Chile. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Larumbe, Federico Daniel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Marenco, Javier Leonardo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; 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.
publishDate 2011
dc.date.none.fl_str_mv 2011-04
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/21015
Bonomo, Flavia; Duran, Guillermo Alfredo; Larumbe, Federico Daniel; Marenco, Javier Leonardo; A method for optimizing waste collection using mathematical programming: a Buenos Aires case study; Sage Publications; Waste Management & Research; 30; 3; 4-2011; 311-324
0734-242X
1096-3669
CONICET Digital
CONICET
url http://hdl.handle.net/11336/21015
identifier_str_mv Bonomo, Flavia; Duran, Guillermo Alfredo; Larumbe, Federico Daniel; Marenco, Javier Leonardo; A method for optimizing waste collection using mathematical programming: a Buenos Aires case study; Sage Publications; Waste Management & Research; 30; 3; 4-2011; 311-324
0734-242X
1096-3669
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1177/0734242X11402870
info:eu-repo/semantics/altIdentifier/url/http://journals.sagepub.com/doi/10.1177/0734242X11402870
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Sage Publications
publisher.none.fl_str_mv Sage Publications
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842269816176508928
score 13.13397

Publicaciones similares