An integrated optimization approach for crowdshipping leveraging smart lockers as decentralized urban transshipment hubs

IF 6.7 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Xin-Yu Zhuang , I-Lin Wang , Chia-Yen Lee
{"title":"An integrated optimization approach for crowdshipping leveraging smart lockers as decentralized urban transshipment hubs","authors":"Xin-Yu Zhuang ,&nbsp;I-Lin Wang ,&nbsp;Chia-Yen Lee","doi":"10.1016/j.cie.2025.111137","DOIUrl":null,"url":null,"abstract":"<div><div>Urban last-mile delivery systems face increasing challenges from rising e-commerce demand, frequent delivery failures, and sustainability concerns. This paper presents a novel integration of decentralized smart lockers into crowdshipping operations, uniquely leveraging their excess capacity as ad hoc transshipment points to improve delivery networks. Specifically, parcels are transferred via smart lockers by one or more crowdshippers, reducing trip detours and expanding geographical coverage. Unlike prior studies, our approach eliminates the need for time-synchronized parcel handovers, significantly enhancing operational flexibility. A mixed-integer programming (MIP) model is developed to optimize driver-parcel assignments and routing for the entire system without imposing a single-transshipment assumption. However, to address scalability challenges in large instances, we introduce a rolling-horizon framework and two tailored column-generation algorithms—complete (CCG) and greedy (GCG)—which assume at most one transshipment per parcel. In experiments with 900 drivers and 300 parcels, the CCG achieves exact solutions in 20 min under this assumption, while the GCG demonstrates a 12.1% cost reduction with a 1–2% optimality gap, requiring significantly less computation time. Although the MIP and rolling-horizon models can only solve smaller instances, they validate the effectiveness of the algorithms. This study provides practical and scalable solutions for overcoming last-mile delivery challenges.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111137"},"PeriodicalIF":6.7000,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835225002839","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Urban last-mile delivery systems face increasing challenges from rising e-commerce demand, frequent delivery failures, and sustainability concerns. This paper presents a novel integration of decentralized smart lockers into crowdshipping operations, uniquely leveraging their excess capacity as ad hoc transshipment points to improve delivery networks. Specifically, parcels are transferred via smart lockers by one or more crowdshippers, reducing trip detours and expanding geographical coverage. Unlike prior studies, our approach eliminates the need for time-synchronized parcel handovers, significantly enhancing operational flexibility. A mixed-integer programming (MIP) model is developed to optimize driver-parcel assignments and routing for the entire system without imposing a single-transshipment assumption. However, to address scalability challenges in large instances, we introduce a rolling-horizon framework and two tailored column-generation algorithms—complete (CCG) and greedy (GCG)—which assume at most one transshipment per parcel. In experiments with 900 drivers and 300 parcels, the CCG achieves exact solutions in 20 min under this assumption, while the GCG demonstrates a 12.1% cost reduction with a 1–2% optimality gap, requiring significantly less computation time. Although the MIP and rolling-horizon models can only solve smaller instances, they validate the effectiveness of the algorithms. This study provides practical and scalable solutions for overcoming last-mile delivery challenges.
一种利用智能储物柜作为分散的城市转运枢纽的众筹综合优化方法
城市 "最后一英里 "配送系统面临着日益严峻的挑战,包括不断增长的电子商务需求、频繁发生的配送故障以及可持续性问题。本文介绍了一种将分散式智能储物柜整合到众包配送业务中的新方法,独特地利用其作为临时转运点的过剩能力来改善配送网络。具体来说,包裹由一个或多个众包商通过智能储物柜转运,从而减少了行程绕道,扩大了地理覆盖范围。与之前的研究不同,我们的方法无需进行时间同步的包裹交接,大大提高了运营灵活性。我们开发了一个混合整数编程(MIP)模型,用于优化整个系统的司机-包裹分配和路由选择,而不强加单一运输假设。然而,为了解决大型实例中的可扩展性难题,我们引入了滚动视距框架和两种定制的列生成算法--完整算法(CCG)和贪婪算法(GCG),这两种算法都假设每个包裹最多只能转运一次。在使用 900 名司机和 300 个包裹进行的实验中,在此假设条件下,CCG 可在 20 分钟内获得精确解,而 GCG 则可降低 12.1% 的成本,优化差距仅为 1-2%,所需的计算时间大大减少。虽然 MIP 模型和滚动地平线模型只能解决较小的实例,但它们验证了算法的有效性。这项研究为克服最后一英里配送挑战提供了实用且可扩展的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Industrial Engineering
Computers & Industrial Engineering 工程技术-工程:工业
CiteScore
12.70
自引率
12.70%
发文量
794
审稿时长
10.6 months
期刊介绍: Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.
×
引用
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学术官方微信