MUNICIPAL SOLID WASTE COLLECTION AND TRANSPORTATION ROUTING OPTIMIZATION BASED ON IAC-SFLA

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Youbiao Hu, Qi-Ping Ju, Taosheng Peng, Shiwen Zhang, Xingming Wang
{"title":"MUNICIPAL SOLID WASTE COLLECTION AND TRANSPORTATION ROUTING OPTIMIZATION BASED ON IAC-SFLA","authors":"Youbiao Hu, Qi-Ping Ju, Taosheng Peng, Shiwen Zhang, Xingming Wang","doi":"10.3846/jeelm.2024.20774","DOIUrl":null,"url":null,"abstract":"In order to realize the efficient collection and low-carbon transport of municipal garbage and accelerate the realize the “dual-carbon” goal for urban transport system, based on the modeling and solving method of vehicle routing problem, the municipal solid waste (MSW) collection and transport routing optimization of an Improved Ant Colony-Shuffled Frog Leaping Algorithm (IAC-SFLA) is proposed. In this study, IAC-SFLA routing Optimization model with the goal of optimization collection distance, average loading rate, number of collections, and average number of stations is constructed. Based on the example data of garbage collection and transport in southern Baohe District, the comparative analysis with single-vehicle models, multiple-vehicle models, and basic ant colony algorithms. The multi-vehicle model of collection and transportation is superior to the single-vehicle model and the improved ant colony algorithm yields a total collection distance that is 19.76 km shorter and an average loading rate that rises by 4.15% from 93.95% to 98.1%. Finally, the improved ant colony algorithm solves for the domestic waste collection and transportation path planning problem in the north district of Baohe. Thus, the effectiveness and application of the proposed algorithm is verified. The research result can provide reference for vehicle routing in the actual collection and transport process, improve collection and transport efficiency, and achieve the goal of energy conservation and emission reduction.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"93","ListUrlMain":"https://doi.org/10.3846/jeelm.2024.20774","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

In order to realize the efficient collection and low-carbon transport of municipal garbage and accelerate the realize the “dual-carbon” goal for urban transport system, based on the modeling and solving method of vehicle routing problem, the municipal solid waste (MSW) collection and transport routing optimization of an Improved Ant Colony-Shuffled Frog Leaping Algorithm (IAC-SFLA) is proposed. In this study, IAC-SFLA routing Optimization model with the goal of optimization collection distance, average loading rate, number of collections, and average number of stations is constructed. Based on the example data of garbage collection and transport in southern Baohe District, the comparative analysis with single-vehicle models, multiple-vehicle models, and basic ant colony algorithms. The multi-vehicle model of collection and transportation is superior to the single-vehicle model and the improved ant colony algorithm yields a total collection distance that is 19.76 km shorter and an average loading rate that rises by 4.15% from 93.95% to 98.1%. Finally, the improved ant colony algorithm solves for the domestic waste collection and transportation path planning problem in the north district of Baohe. Thus, the effectiveness and application of the proposed algorithm is verified. The research result can provide reference for vehicle routing in the actual collection and transport process, improve collection and transport efficiency, and achieve the goal of energy conservation and emission reduction.
基于 IAC-SFLA 的城市固体废物收集和运输路线优化
为实现城市垃圾的高效收集与低碳运输,加快实现城市交通系统的 "双碳 "目标,基于车辆路由问题的建模与求解方法,提出了城市固体废物(MSW)收集与运输路由优化的改进蚁群-蛙跳算法(IAC-SFLA)。本研究构建了以优化收集距离、平均装载率、收集次数和平均站点数为目标的 IAC-SFLA 路由优化模型。基于包河区南部垃圾收集运输的实例数据,与单车模型、多车模型和基本蚁群算法进行了对比分析。多车收运模式优于单车收运模式,改进的蚁群算法使总收运距离缩短了 19.76 公里,平均装载率从 93.95%提高到 98.1%,提高了 4.15%。最后,改进的蚁群算法解决了包河北区生活垃圾收运路径规划问题。由此,验证了所提算法的有效性和应用性。该研究成果可为实际收运过程中的车辆选线提供参考,提高收运效率,实现节能减排的目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
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学术官方微信