智能垃圾收集的动态多车厢车辆路径问题

IF 3.8 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yousra Bouleft, Ahmed Elhilali Alaoui
{"title":"智能垃圾收集的动态多车厢车辆路径问题","authors":"Yousra Bouleft, Ahmed Elhilali Alaoui","doi":"10.3390/asi6010030","DOIUrl":null,"url":null,"abstract":"The rapid increase in urbanization results in an increase in the volume of municipal solid waste produced every day, causing overflow of the garbage cans and thus distorting the city’s appearance; for this and environmental reasons, smart cities involve the use of modern technologies for intelligent and efficient waste management. Smart bins in urban environments contain sensors that measure the status of containers in real-time and trigger wireless alarms if the container reaches a predetermined threshold, and then communicate the information to the operations center, which then sends vehicles to collect the waste from the selected stations in order to collect a significant waste amount and reduce transportation costs. In this article, we will address the issue of the Dynamic Multi-Compartmental Vehicle Routing Problem (DM-CVRP) for selective and intelligent waste collection. This problem is summarized as a linear mathematical programming model to define optimal dynamic routes to minimize the total cost, which are the transportation costs and the penalty costs caused by exceeding the bin capacity. The hybridized genetic algorithm (GA) is proposed to solve this problem, and the effectiveness of the proposed approach is verified by extensive numerical experiments on instances given by Valorsul, with some modifications to adapt these data to our problem. Then we were able to ensure the effectiveness of our approach based on the results in the static and dynamic cases, which are very encouraging.","PeriodicalId":36273,"journal":{"name":"Applied System Innovation","volume":" ","pages":""},"PeriodicalIF":3.8000,"publicationDate":"2023-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Dynamic Multi-Compartment Vehicle Routing Problem for Smart Waste Collection\",\"authors\":\"Yousra Bouleft, Ahmed Elhilali Alaoui\",\"doi\":\"10.3390/asi6010030\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid increase in urbanization results in an increase in the volume of municipal solid waste produced every day, causing overflow of the garbage cans and thus distorting the city’s appearance; for this and environmental reasons, smart cities involve the use of modern technologies for intelligent and efficient waste management. Smart bins in urban environments contain sensors that measure the status of containers in real-time and trigger wireless alarms if the container reaches a predetermined threshold, and then communicate the information to the operations center, which then sends vehicles to collect the waste from the selected stations in order to collect a significant waste amount and reduce transportation costs. In this article, we will address the issue of the Dynamic Multi-Compartmental Vehicle Routing Problem (DM-CVRP) for selective and intelligent waste collection. This problem is summarized as a linear mathematical programming model to define optimal dynamic routes to minimize the total cost, which are the transportation costs and the penalty costs caused by exceeding the bin capacity. The hybridized genetic algorithm (GA) is proposed to solve this problem, and the effectiveness of the proposed approach is verified by extensive numerical experiments on instances given by Valorsul, with some modifications to adapt these data to our problem. Then we were able to ensure the effectiveness of our approach based on the results in the static and dynamic cases, which are very encouraging.\",\"PeriodicalId\":36273,\"journal\":{\"name\":\"Applied System Innovation\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2023-02-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied System Innovation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3390/asi6010030\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied System Innovation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/asi6010030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 3

摘要

城市化的快速发展导致每天产生的城市生活垃圾数量增加,导致垃圾桶溢出,从而扭曲了城市的外观;出于这个原因和环境原因,智慧城市涉及使用现代技术进行智能和高效的废物管理。城市环境中的智能垃圾箱包含传感器,可以实时测量集装箱的状态,如果集装箱达到预定的阈值,就会触发无线警报,然后将信息传达给运营中心,然后运营中心将车辆从选定的站点收集废物,以收集大量废物并降低运输成本。在本文中,我们将解决动态多车厢车辆路径问题(DM-CVRP)的选择性和智能废物收集的问题。该问题可以归结为一个线性数学规划模型,定义最优的动态路线,以使总成本最小,即运输成本和超过垃圾箱容量造成的惩罚成本。提出了一种混合遗传算法(GA)来解决这一问题,并通过Valorsul给出的大量数值实验验证了该方法的有效性,并对这些数据进行了一些修改以适应我们的问题。然后,我们能够根据静态和动态案例的结果确保我们方法的有效性,这是非常令人鼓舞的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic Multi-Compartment Vehicle Routing Problem for Smart Waste Collection
The rapid increase in urbanization results in an increase in the volume of municipal solid waste produced every day, causing overflow of the garbage cans and thus distorting the city’s appearance; for this and environmental reasons, smart cities involve the use of modern technologies for intelligent and efficient waste management. Smart bins in urban environments contain sensors that measure the status of containers in real-time and trigger wireless alarms if the container reaches a predetermined threshold, and then communicate the information to the operations center, which then sends vehicles to collect the waste from the selected stations in order to collect a significant waste amount and reduce transportation costs. In this article, we will address the issue of the Dynamic Multi-Compartmental Vehicle Routing Problem (DM-CVRP) for selective and intelligent waste collection. This problem is summarized as a linear mathematical programming model to define optimal dynamic routes to minimize the total cost, which are the transportation costs and the penalty costs caused by exceeding the bin capacity. The hybridized genetic algorithm (GA) is proposed to solve this problem, and the effectiveness of the proposed approach is verified by extensive numerical experiments on instances given by Valorsul, with some modifications to adapt these data to our problem. Then we were able to ensure the effectiveness of our approach based on the results in the static and dynamic cases, which are very encouraging.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied System Innovation
Applied System Innovation Mathematics-Applied Mathematics
CiteScore
7.90
自引率
5.30%
发文量
102
审稿时长
11 weeks
×
引用
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学术官方微信