带时间窗口的多网点时变车辆路由问题中的协作与资源共享

Yong Wang , Zikai Wei , Siyu Luo , Jingxin Zhou , Lu Zhen
{"title":"带时间窗口的多网点时变车辆路由问题中的协作与资源共享","authors":"Yong Wang ,&nbsp;Zikai Wei ,&nbsp;Siyu Luo ,&nbsp;Jingxin Zhou ,&nbsp;Lu Zhen","doi":"10.1016/j.tre.2024.103798","DOIUrl":null,"url":null,"abstract":"<div><div>Concerns about energy conservation and emission reduction have highlighted the importance of environmentally sound logistics networks in urban areas. These networks are deeply intertwined with urban traffic systems, where variations in transit speeds can significantly increase the energy consumption and carbon emissions of delivery vehicles, compromising the environmental sustainability of urban deliveries. To address this, we propose a multidepot time-dependent vehicle routing problem with time windows, enhancing route planning flexibility and resource configuration. Our approach begins with a route spatiotemporal decomposition method to estimate vehicle travel times and emissions based on varying vehicle speeds. We then develop a multiobjective mixed integer linear programming model that aims to minimize total operating costs, the number of vehicles, and carbon dioxide emissions. A hybrid heuristic algorithm combining spectral clustering, multiobjective ant colony optimization, and variable neighborhood search is proposed to solve the model. This algorithm incorporates collaboration and resource sharing strategies, a pheromone initialization mechanism, a novel heuristic operator that accounts for time dependency, and a self-adaptive update mechanism, enhancing both solution quality and algorithm convergence. We compare the performance of our algorithm with that of the CPLEX solver, multiobjective ant colony optimization, non-dominated sorting genetic algorithm-Ⅲ, and multiobjective particle swarm optimization. The results demonstrate the superior convergence, uniformity, and spread of our proposed algorithm. Furthermore, we apply our model and algorithm to a real-world case in Chongqing, China, analyzing optimized results for different time intervals and vehicle speeds. This study offers robust methodologies for theoretically and practically addressing the multidepot time-dependent vehicle routing problem with time windows, contributing to the development of economical, efficient, collaborative, and sustainable urban logistics networks.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":null,"pages":null},"PeriodicalIF":8.3000,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows\",\"authors\":\"Yong Wang ,&nbsp;Zikai Wei ,&nbsp;Siyu Luo ,&nbsp;Jingxin Zhou ,&nbsp;Lu Zhen\",\"doi\":\"10.1016/j.tre.2024.103798\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Concerns about energy conservation and emission reduction have highlighted the importance of environmentally sound logistics networks in urban areas. These networks are deeply intertwined with urban traffic systems, where variations in transit speeds can significantly increase the energy consumption and carbon emissions of delivery vehicles, compromising the environmental sustainability of urban deliveries. To address this, we propose a multidepot time-dependent vehicle routing problem with time windows, enhancing route planning flexibility and resource configuration. Our approach begins with a route spatiotemporal decomposition method to estimate vehicle travel times and emissions based on varying vehicle speeds. We then develop a multiobjective mixed integer linear programming model that aims to minimize total operating costs, the number of vehicles, and carbon dioxide emissions. A hybrid heuristic algorithm combining spectral clustering, multiobjective ant colony optimization, and variable neighborhood search is proposed to solve the model. This algorithm incorporates collaboration and resource sharing strategies, a pheromone initialization mechanism, a novel heuristic operator that accounts for time dependency, and a self-adaptive update mechanism, enhancing both solution quality and algorithm convergence. We compare the performance of our algorithm with that of the CPLEX solver, multiobjective ant colony optimization, non-dominated sorting genetic algorithm-Ⅲ, and multiobjective particle swarm optimization. The results demonstrate the superior convergence, uniformity, and spread of our proposed algorithm. Furthermore, we apply our model and algorithm to a real-world case in Chongqing, China, analyzing optimized results for different time intervals and vehicle speeds. This study offers robust methodologies for theoretically and practically addressing the multidepot time-dependent vehicle routing problem with time windows, contributing to the development of economical, efficient, collaborative, and sustainable urban logistics networks.</div></div>\",\"PeriodicalId\":49418,\"journal\":{\"name\":\"Transportation Research Part E-Logistics and Transportation Review\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":8.3000,\"publicationDate\":\"2024-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part E-Logistics and Transportation Review\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1366554524003892\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part E-Logistics and Transportation Review","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1366554524003892","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

对节能减排的关注凸显了城市地区环保型物流网络的重要性。这些网络与城市交通系统密切相关,运输速度的变化会显著增加配送车辆的能耗和碳排放,影响城市配送的环境可持续性。为此,我们提出了一个具有时间窗口的多网点随时间变化的车辆路由问题,以增强路线规划的灵活性和资源配置。我们的方法从路线时空分解法开始,根据不同的车辆速度估算车辆行驶时间和排放量。然后,我们建立了一个多目标混合整数线性规划模型,旨在最大限度地降低总运营成本、车辆数量和二氧化碳排放量。我们提出了一种混合启发式算法,结合了光谱聚类、多目标蚁群优化和变量邻域搜索来解决该模型。该算法结合了协作和资源共享策略、信息素初始化机制、考虑时间依赖性的新型启发式算子以及自适应更新机制,从而提高了求解质量和算法收敛性。我们比较了我们的算法与 CPLEX 求解器、多目标蚁群优化、非支配排序遗传算法-Ⅲ 和多目标粒子群优化的性能。结果表明,我们提出的算法具有卓越的收敛性、均匀性和扩展性。此外,我们还将模型和算法应用于中国重庆的实际案例,分析了不同时间间隔和车速下的优化结果。这项研究为从理论和实践上解决具有时间窗口的多网点时间相关车辆路由问题提供了可靠的方法,有助于发展经济、高效、协作和可持续的城市物流网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows
Concerns about energy conservation and emission reduction have highlighted the importance of environmentally sound logistics networks in urban areas. These networks are deeply intertwined with urban traffic systems, where variations in transit speeds can significantly increase the energy consumption and carbon emissions of delivery vehicles, compromising the environmental sustainability of urban deliveries. To address this, we propose a multidepot time-dependent vehicle routing problem with time windows, enhancing route planning flexibility and resource configuration. Our approach begins with a route spatiotemporal decomposition method to estimate vehicle travel times and emissions based on varying vehicle speeds. We then develop a multiobjective mixed integer linear programming model that aims to minimize total operating costs, the number of vehicles, and carbon dioxide emissions. A hybrid heuristic algorithm combining spectral clustering, multiobjective ant colony optimization, and variable neighborhood search is proposed to solve the model. This algorithm incorporates collaboration and resource sharing strategies, a pheromone initialization mechanism, a novel heuristic operator that accounts for time dependency, and a self-adaptive update mechanism, enhancing both solution quality and algorithm convergence. We compare the performance of our algorithm with that of the CPLEX solver, multiobjective ant colony optimization, non-dominated sorting genetic algorithm-Ⅲ, and multiobjective particle swarm optimization. The results demonstrate the superior convergence, uniformity, and spread of our proposed algorithm. Furthermore, we apply our model and algorithm to a real-world case in Chongqing, China, analyzing optimized results for different time intervals and vehicle speeds. This study offers robust methodologies for theoretically and practically addressing the multidepot time-dependent vehicle routing problem with time windows, contributing to the development of economical, efficient, collaborative, and sustainable urban logistics networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
16.20
自引率
16.00%
发文量
285
审稿时长
62 days
期刊介绍: Transportation Research Part E: Logistics and Transportation Review is a reputable journal that publishes high-quality articles covering a wide range of topics in the field of logistics and transportation research. The journal welcomes submissions on various subjects, including transport economics, transport infrastructure and investment appraisal, evaluation of public policies related to transportation, empirical and analytical studies of logistics management practices and performance, logistics and operations models, and logistics and supply chain management. Part E aims to provide informative and well-researched articles that contribute to the understanding and advancement of the field. The content of the journal is complementary to other prestigious journals in transportation research, such as Transportation Research Part A: Policy and Practice, Part B: Methodological, Part C: Emerging Technologies, Part D: Transport and Environment, and Part F: Traffic Psychology and Behaviour. Together, these journals form a comprehensive and cohesive reference for current research in transportation science.
期刊最新文献
Meal pickup and delivery problem with appointment time and uncertainty in order cancellation The rich get richer: Derivative revenue as a catalyst for bike-sharing subscription services Distributionally robust optimization for pre-disaster facility location problem with 3D printing Traffic Flow Outlier Detection for Smart Mobility Using Gaussian Process Regression Assisted Stochastic Differential Equations Prototype augmentation-based spatiotemporal anomaly detection in smart mobility systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1