具有动态补偿和转运功能的分批装运问题

IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Transportation Research Part C-Emerging Technologies Pub Date : 2024-08-07 DOI:10.1016/j.trc.2024.104796
{"title":"具有动态补偿和转运功能的分批装运问题","authors":"","doi":"10.1016/j.trc.2024.104796","DOIUrl":null,"url":null,"abstract":"<div><p>Rapid urban growth and consequent increase in e-commerce demand make urban logistics a harder task than ever. The growing size of urban delivery operations not only entails operational challenges but also generates several negative externalities, such as increased traffic, pollution, noise, and accidents. This trend creates a pressing need for efficient delivery mechanisms that are more economical and environmentally friendly than existing systems. Crowdshipping, wherein ordinary members of the society partake in delivery operations for a small compensation, is one of the answers that cater to this need and has attracted considerable research interest recently. However, designing compensation mechanisms to prompt efficient participation from the public remains largely unexplored in the literature. In this study, we devise a dynamic compensation scheme for crowdshipping operations in a many-to-many express delivery framework, where the crowdshipper compensations are determined based on spatial and temporal distributions of the delivery demand and continually updated during the service time to leverage the crowd participation as needed. To address the resulting complex network management problem, we derive analytical solutions for compensation optimization and use these results along with effective pruning strategies to build a lookup table to simultaneously determine package routes and compensation offers in real time. Computational studies and extensive simulations conducted with real-world data show that our proposed approach can provide significant cost savings and considerably reduce operational costs and other transport-related negative externalities when compared to classical delivery modes, crowdshipping with static compensations, and crowdshipping without transshipment.</p></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":null,"pages":null},"PeriodicalIF":7.6000,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0968090X24003176/pdfft?md5=93df452ea1ac877a96ef03a0328720aa&pid=1-s2.0-S0968090X24003176-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Crowdshipping problem with dynamic compensations and transshipments\",\"authors\":\"\",\"doi\":\"10.1016/j.trc.2024.104796\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Rapid urban growth and consequent increase in e-commerce demand make urban logistics a harder task than ever. The growing size of urban delivery operations not only entails operational challenges but also generates several negative externalities, such as increased traffic, pollution, noise, and accidents. This trend creates a pressing need for efficient delivery mechanisms that are more economical and environmentally friendly than existing systems. Crowdshipping, wherein ordinary members of the society partake in delivery operations for a small compensation, is one of the answers that cater to this need and has attracted considerable research interest recently. However, designing compensation mechanisms to prompt efficient participation from the public remains largely unexplored in the literature. In this study, we devise a dynamic compensation scheme for crowdshipping operations in a many-to-many express delivery framework, where the crowdshipper compensations are determined based on spatial and temporal distributions of the delivery demand and continually updated during the service time to leverage the crowd participation as needed. To address the resulting complex network management problem, we derive analytical solutions for compensation optimization and use these results along with effective pruning strategies to build a lookup table to simultaneously determine package routes and compensation offers in real time. Computational studies and extensive simulations conducted with real-world data show that our proposed approach can provide significant cost savings and considerably reduce operational costs and other transport-related negative externalities when compared to classical delivery modes, crowdshipping with static compensations, and crowdshipping without transshipment.</p></div>\",\"PeriodicalId\":54417,\"journal\":{\"name\":\"Transportation Research Part C-Emerging Technologies\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.6000,\"publicationDate\":\"2024-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0968090X24003176/pdfft?md5=93df452ea1ac877a96ef03a0328720aa&pid=1-s2.0-S0968090X24003176-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part C-Emerging Technologies\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0968090X24003176\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"TRANSPORTATION SCIENCE & TECHNOLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part C-Emerging Technologies","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0968090X24003176","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TRANSPORTATION SCIENCE & TECHNOLOGY","Score":null,"Total":0}
引用次数: 0

摘要

城市的快速发展和随之而来的电子商务需求的增加,使城市物流成为一项前所未有的艰巨任务。城市配送业务规模的不断扩大不仅带来了运营方面的挑战,还产生了一些负面的外部效应,如交通流量增加、污染、噪音和事故。这种趋势迫切需要比现有系统更经济、更环保的高效配送机制。众包(Crowdshipping),即普通社会成员以少量报酬参与配送业务,是满足这一需求的解决方案之一,最近引起了相当大的研究兴趣。然而,设计补偿机制以促使公众有效参与的问题在文献中基本上仍未得到探讨。在本研究中,我们为多对多快递框架中的众包业务设计了一种动态补偿方案,其中众包补偿是根据快递需求的空间和时间分布确定的,并在服务期间不断更新,以根据需要利用人群的参与。为了解决由此产生的复杂网络管理问题,我们推导出了补偿优化的分析解决方案,并利用这些结果和有效的剪枝策略建立了一个查找表,以同时实时确定包裹路线和补偿提议。计算研究和使用真实世界数据进行的大量仿真表明,与传统交付模式、静态补偿的众包运输和不转运的众包运输相比,我们提出的方法可以显著节约成本,并大大降低运营成本和其他与运输相关的负外部性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Crowdshipping problem with dynamic compensations and transshipments

Rapid urban growth and consequent increase in e-commerce demand make urban logistics a harder task than ever. The growing size of urban delivery operations not only entails operational challenges but also generates several negative externalities, such as increased traffic, pollution, noise, and accidents. This trend creates a pressing need for efficient delivery mechanisms that are more economical and environmentally friendly than existing systems. Crowdshipping, wherein ordinary members of the society partake in delivery operations for a small compensation, is one of the answers that cater to this need and has attracted considerable research interest recently. However, designing compensation mechanisms to prompt efficient participation from the public remains largely unexplored in the literature. In this study, we devise a dynamic compensation scheme for crowdshipping operations in a many-to-many express delivery framework, where the crowdshipper compensations are determined based on spatial and temporal distributions of the delivery demand and continually updated during the service time to leverage the crowd participation as needed. To address the resulting complex network management problem, we derive analytical solutions for compensation optimization and use these results along with effective pruning strategies to build a lookup table to simultaneously determine package routes and compensation offers in real time. Computational studies and extensive simulations conducted with real-world data show that our proposed approach can provide significant cost savings and considerably reduce operational costs and other transport-related negative externalities when compared to classical delivery modes, crowdshipping with static compensations, and crowdshipping without transshipment.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
15.80
自引率
12.00%
发文量
332
审稿时长
64 days
期刊介绍: Transportation Research: Part C (TR_C) is dedicated to showcasing high-quality, scholarly research that delves into the development, applications, and implications of transportation systems and emerging technologies. Our focus lies not solely on individual technologies, but rather on their broader implications for the planning, design, operation, control, maintenance, and rehabilitation of transportation systems, services, and components. In essence, the intellectual core of the journal revolves around the transportation aspect rather than the technology itself. We actively encourage the integration of quantitative methods from diverse fields such as operations research, control systems, complex networks, computer science, and artificial intelligence. Join us in exploring the intersection of transportation systems and emerging technologies to drive innovation and progress in the field.
期刊最新文献
An environmentally-aware dynamic planning of electric vehicles for aircraft towing considering stochastic aircraft arrival and departure times Network-wide speed–flow estimation considering uncertain traffic conditions and sparse multi-type detectors: A KL divergence-based optimization approach Revealing the impacts of COVID-19 pandemic on intercity truck transport: New insights from big data analytics MATNEC: AIS data-driven environment-adaptive maritime traffic network construction for realistic route generation A qualitative AI security risk assessment of autonomous vehicles
×
引用
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