Developing Optimization Tools for Municipal Solid Waste Collection in the Argentine City of Berazategui

IF 1.1 4区 管理学 Q4 MANAGEMENT
Federico Bertero, M. Cerdeiro, Guillermo A. Durán, Nazareno A. Faillace Mullen
{"title":"Developing Optimization Tools for Municipal Solid Waste Collection in the Argentine City of Berazategui","authors":"Federico Bertero, M. Cerdeiro, Guillermo A. Durán, Nazareno A. Faillace Mullen","doi":"10.1287/inte.2022.0042","DOIUrl":null,"url":null,"abstract":"We apply mathematical and computational techniques to the development of an approach for optimizing the waste collection system of the Argentine city of Berazategui, 26 km south of Buenos Aires. Taking full account of the city’s particular characteristics, our objective is to not only improve the system’s efficiency but also ensure equitable workloads for waste collection truck crews, including both drivers and collectors. The optimization problem is partitioned into three stages. In the first stage, a heuristic constructs structurally simple collection zones that are balanced in terms of collectors’ walking distances. In the second stage, a mixed-integer linear programming model designs a collection truck route for each zone and minimizes its length. In the third and final stage, each truck is assigned to two zones in such a way as to equalize to the extent possible the length of drivers’ working day. Because working-day length is influenced by multiple factors, we formulate this objective as a biobjective optimization problem and solve it by integer linear programming coupled with an iterative algorithm. The city implemented the approach in early 2020, resulting in a markedly more equitable workload distribution and significant fuel savings and maintenance expense for the city. History: This paper was refereed. Funding: This work was partly financed by the Universidad de Buenos Aires Ciencia y Técnica [Grant 20020170100495BA] (Argentina) and Proyectos de Investigación Plurianuales - Consejo Nacional de Investigaciones Científicas y Técnicas [Grant 11220200100084CO (Argentina)]. G. A. Durán is also funded by the Instituto Sistemas Complejos de Ingeniería in Chile [Grants Iniciativa Científica Milenio - Fondo de Innovación para la Competitividad P05-004-F and Comisión Nacional de Investigación Científica y Tecnológica FB0816].","PeriodicalId":53206,"journal":{"name":"Informs Journal on Applied Analytics","volume":"53 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Informs Journal on Applied Analytics","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/inte.2022.0042","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

We apply mathematical and computational techniques to the development of an approach for optimizing the waste collection system of the Argentine city of Berazategui, 26 km south of Buenos Aires. Taking full account of the city’s particular characteristics, our objective is to not only improve the system’s efficiency but also ensure equitable workloads for waste collection truck crews, including both drivers and collectors. The optimization problem is partitioned into three stages. In the first stage, a heuristic constructs structurally simple collection zones that are balanced in terms of collectors’ walking distances. In the second stage, a mixed-integer linear programming model designs a collection truck route for each zone and minimizes its length. In the third and final stage, each truck is assigned to two zones in such a way as to equalize to the extent possible the length of drivers’ working day. Because working-day length is influenced by multiple factors, we formulate this objective as a biobjective optimization problem and solve it by integer linear programming coupled with an iterative algorithm. The city implemented the approach in early 2020, resulting in a markedly more equitable workload distribution and significant fuel savings and maintenance expense for the city. History: This paper was refereed. Funding: This work was partly financed by the Universidad de Buenos Aires Ciencia y Técnica [Grant 20020170100495BA] (Argentina) and Proyectos de Investigación Plurianuales - Consejo Nacional de Investigaciones Científicas y Técnicas [Grant 11220200100084CO (Argentina)]. G. A. Durán is also funded by the Instituto Sistemas Complejos de Ingeniería in Chile [Grants Iniciativa Científica Milenio - Fondo de Innovación para la Competitividad P05-004-F and Comisión Nacional de Investigación Científica y Tecnológica FB0816].
阿根廷贝拉萨特吉市城市固体废物收集优化工具的开发
我们应用数学和计算技术来开发一种方法,以优化阿根廷城市贝拉萨特吉的废物收集系统,布宜诺斯艾利斯以南26公里。充分考虑到城市的特点,我们的目标不仅是提高系统的效率,而且要确保垃圾收集车工作人员(包括司机和收集人员)的工作量公平。优化问题分为三个阶段。在第一阶段,启发式构建结构简单的收集区域,这些区域在收集者的步行距离方面是平衡的。在第二阶段,混合整数线性规划模型为每个区域设计一条集运车路线并使其长度最小化。在第三个也是最后一个阶段,每辆卡车被分配到两个区域,以便尽可能地使司机的工作日长度相等。由于工作日长度受多种因素的影响,我们将该目标表述为一个双目标优化问题,并采用整数线性规划与迭代算法相结合的方法进行求解。该市在2020年初实施了这一方法,从而使工作量分配明显更加公平,并为该市节省了大量燃料和维护费用。历史:本文被审稿。资助:本工作部分由布宜诺斯艾利斯大学(university of Buenos Aires Ciencia y tacimnica) [Grant 20020170100495BA](阿根廷)和Investigación Plurianuales - conjo Nacional de investigacones Científicas y tacimnicas [Grant 11220200100084CO(阿根廷)]项目资助。g.a. Durán也得到了智利系统综合研究所Ingeniería的资助[Grants Iniciativa Científica Milenio - Fondo de Innovación para la competitivad P05-004-F和Comisión Nacional de Investigación Científica y Tecnológica FB0816]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
21.40%
发文量
51
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信