Comparison of Multiobjective Evolutionary Algorithms for Prioritized Urban Waste Collection in Montevideo, Uruguay

Q2 Mathematics
Sergio Nesmachnow , Diego Rossit , Jamal Toutouh
{"title":"Comparison of Multiobjective Evolutionary Algorithms for Prioritized Urban Waste Collection in Montevideo, Uruguay","authors":"Sergio Nesmachnow ,&nbsp;Diego Rossit ,&nbsp;Jamal Toutouh","doi":"10.1016/j.endm.2018.07.013","DOIUrl":null,"url":null,"abstract":"<div><p>Urban waste collection is an important problem in modern cities, where efficient techniques are demanded to reduce large budgetary expenses, and avoid environmental and social problems. This article presents two state-of-the-art multiobjective evolutionary algorithms to solve a variant of the urban waste collection problem considering priorities and the conflicting goals of minimizing the total distance while maximizing the Quality of Service. The main results for real scenarios in Montevideo, Uruguay, show that accurate trade-off solutions outperformed greedy approaches, including the current routing methodology applied by local authorities. The competitiveness of the evolutionary algorithms was also confirmed when solving a prototype scenario using dynamic information.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.013","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301574","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 23

Abstract

Urban waste collection is an important problem in modern cities, where efficient techniques are demanded to reduce large budgetary expenses, and avoid environmental and social problems. This article presents two state-of-the-art multiobjective evolutionary algorithms to solve a variant of the urban waste collection problem considering priorities and the conflicting goals of minimizing the total distance while maximizing the Quality of Service. The main results for real scenarios in Montevideo, Uruguay, show that accurate trade-off solutions outperformed greedy approaches, including the current routing methodology applied by local authorities. The competitiveness of the evolutionary algorithms was also confirmed when solving a prototype scenario using dynamic information.

乌拉圭蒙得维的亚城市垃圾优先收集的多目标进化算法比较
城市垃圾收集是现代城市的一个重要问题,需要高效的技术来减少大量的预算开支,避免环境和社会问题。本文提出了两种最先进的多目标进化算法来解决城市垃圾收集问题的一个变体,考虑优先级和最小化总距离和最大化服务质量的冲突目标。乌拉圭蒙得维的亚真实场景的主要结果表明,准确的权衡解决方案优于贪婪的方法,包括地方当局目前采用的路由方法。在求解使用动态信息的原型场景时,也证实了进化算法的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics
CiteScore
1.30
自引率
0.00%
发文量
0
期刊介绍: Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
×
引用
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学术官方微信