基于在线预约模式下基于MOACO-ET算法的固废回收车辆路径优化模型

IF 2.4 Q3 TRANSPORTATION
Cuiying Song , Shiwei Chen
{"title":"基于在线预约模式下基于MOACO-ET算法的固废回收车辆路径优化模型","authors":"Cuiying Song ,&nbsp;Shiwei Chen","doi":"10.1016/j.cstp.2025.101373","DOIUrl":null,"url":null,"abstract":"<div><div>Solid waste (SW) recycling is essential to preserving the environment and lowering pollution. Countries around the world promote their residents to participate in SW recycling. This study proposes an online appointment-based SW recycling mode to overcome the limitations of traditional recycling ways, such as limited coverage, low efficiency, and the uncertainty of customer recycling times. Combined with this mode, we build a multi-objective optimization model aimed at finding the optimal vehicle routes within each customer’s acceptable time window, with the goals of reducing operating costs of the recycling industry and customer dissatisfaction with recycling services. A multi-objective ant colony optimization algorithm based on elite thought (MOACO-ET) is designed to solve the suggested model, seek balance among multiple objectives, search for diversified Pareto optimal solutions, and provide flexible and adaptive solutions. To verify the effectiveness of the proposed model and the performance of the MOACO-ET algorithm, a comparative analysis is conducted with the Max-Min Ant System (MMAS) in a case study. We find that MOACO-ET algorithm exhibits better convergence and search performance, customer dissatisfaction can be decreased by 47.58%, and average operating costs and total vehicle mileage are reduced by 2.02% and 2.67%, respectively. This study combines multi-objective optimization with the MOACO-ET algorithm to propose an effective solution for optimizing the collection and transportation routes of recycling vehicles. This approach helps improve SW recycling efficiency, reduce transportation costs, enhance service quality, and promote sustainable development.</div></div>","PeriodicalId":46989,"journal":{"name":"Case Studies on Transport Policy","volume":"19 ","pages":"Article 101373"},"PeriodicalIF":2.4000,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A solid waste recycling vehicle routing optimization model under online appointment-based mode using MOACO-ET algorithm\",\"authors\":\"Cuiying Song ,&nbsp;Shiwei Chen\",\"doi\":\"10.1016/j.cstp.2025.101373\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Solid waste (SW) recycling is essential to preserving the environment and lowering pollution. Countries around the world promote their residents to participate in SW recycling. This study proposes an online appointment-based SW recycling mode to overcome the limitations of traditional recycling ways, such as limited coverage, low efficiency, and the uncertainty of customer recycling times. Combined with this mode, we build a multi-objective optimization model aimed at finding the optimal vehicle routes within each customer’s acceptable time window, with the goals of reducing operating costs of the recycling industry and customer dissatisfaction with recycling services. A multi-objective ant colony optimization algorithm based on elite thought (MOACO-ET) is designed to solve the suggested model, seek balance among multiple objectives, search for diversified Pareto optimal solutions, and provide flexible and adaptive solutions. To verify the effectiveness of the proposed model and the performance of the MOACO-ET algorithm, a comparative analysis is conducted with the Max-Min Ant System (MMAS) in a case study. We find that MOACO-ET algorithm exhibits better convergence and search performance, customer dissatisfaction can be decreased by 47.58%, and average operating costs and total vehicle mileage are reduced by 2.02% and 2.67%, respectively. This study combines multi-objective optimization with the MOACO-ET algorithm to propose an effective solution for optimizing the collection and transportation routes of recycling vehicles. This approach helps improve SW recycling efficiency, reduce transportation costs, enhance service quality, and promote sustainable development.</div></div>\",\"PeriodicalId\":46989,\"journal\":{\"name\":\"Case Studies on Transport Policy\",\"volume\":\"19 \",\"pages\":\"Article 101373\"},\"PeriodicalIF\":2.4000,\"publicationDate\":\"2025-01-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Case Studies on Transport Policy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2213624X25000100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"TRANSPORTATION\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Case Studies on Transport Policy","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2213624X25000100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 0

摘要

回收固体废物对保护环境和减少污染至关重要。世界各国都在推动居民参与SW回收。本研究提出了一种基于在线预约的软件回收模式,以克服传统回收方式覆盖范围有限、效率低、客户回收时间不确定等局限性。结合该模型,以降低回收行业的运营成本和客户对回收服务的不满为目标,在每个客户可接受的时间窗口内找到最优的车辆路线,建立了多目标优化模型。设计了一种基于精英思想的多目标蚁群优化算法(MOACO-ET)来求解该模型,寻求多目标之间的平衡,寻找多样化的Pareto最优解,并提供灵活的自适应解。为了验证所提模型的有效性和MOACO-ET算法的性能,以实例与最大最小蚂蚁系统(Max-Min Ant System, MMAS)进行对比分析。研究发现,MOACO-ET算法具有较好的收敛性和搜索性能,客户不满意度降低了47.58%,平均运营成本和总行驶里程分别降低了2.02%和2.67%。本研究将多目标优化与MOACO-ET算法相结合,提出了一种有效的回收车辆集运路线优化方案。这种方法有助于提高SW回收效率,降低运输成本,提高服务质量,促进可持续发展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A solid waste recycling vehicle routing optimization model under online appointment-based mode using MOACO-ET algorithm
Solid waste (SW) recycling is essential to preserving the environment and lowering pollution. Countries around the world promote their residents to participate in SW recycling. This study proposes an online appointment-based SW recycling mode to overcome the limitations of traditional recycling ways, such as limited coverage, low efficiency, and the uncertainty of customer recycling times. Combined with this mode, we build a multi-objective optimization model aimed at finding the optimal vehicle routes within each customer’s acceptable time window, with the goals of reducing operating costs of the recycling industry and customer dissatisfaction with recycling services. A multi-objective ant colony optimization algorithm based on elite thought (MOACO-ET) is designed to solve the suggested model, seek balance among multiple objectives, search for diversified Pareto optimal solutions, and provide flexible and adaptive solutions. To verify the effectiveness of the proposed model and the performance of the MOACO-ET algorithm, a comparative analysis is conducted with the Max-Min Ant System (MMAS) in a case study. We find that MOACO-ET algorithm exhibits better convergence and search performance, customer dissatisfaction can be decreased by 47.58%, and average operating costs and total vehicle mileage are reduced by 2.02% and 2.67%, respectively. This study combines multi-objective optimization with the MOACO-ET algorithm to propose an effective solution for optimizing the collection and transportation routes of recycling vehicles. This approach helps improve SW recycling efficiency, reduce transportation costs, enhance service quality, and promote sustainable development.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
5.00
自引率
12.00%
发文量
222
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信