TY - JOUR
T1 - Joint optimization of parcel allocation and crowd routing for crowdsourced last-mile delivery
AU - Wang, Li
AU - Xu, Min
AU - Qin, Hu
N1 - Funding Information:
The authors gratefully thank Dr. Kianoush Mousavi, Prof. Merve Bodur, and Prof. Matthew J. Roorda for providing us the problem instances generated based on the data of transportation tomorrow survey (TTS) from the data management group (DMG) in the City of Toronto. The work described in this paper was supported by National Natural Science Foundation of China (No. 71901189 ) and the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. PolyU 15221821), and the Research Committee of The Hong Kong Polytechnic University (UAKQ). This research was also supported by National Natural Science Foundation of China (Grant nos. 71971090 , 71821001 , 7210010522 ).
Publisher Copyright:
© 2023 Elsevier Ltd
PY - 2023/5
Y1 - 2023/5
N2 - Urban last-mile delivery providers are facing more and more challenges with the explosive development of e-commerce. The advancement of smart mobile and communication technology in recent years has stimulated the development of a new business model of city logistics, referred to as crowdsourced delivery or crowd-shipping. In this paper, we investigate a form of crowdsourced last-mile delivery that utilizes the journeys of commuters/travelers (crowd-couriers) to deliver parcels from intermediate stations to customers. We consider a logistics service provider that jointly optimizes parcel allocation to intermediate stations and the delivery routing of the crowd-couriers. The joint optimization model gives rise to a new variant of the last-mile delivery problem. We propose a data-driven column generation algorithm to solve the problem based on a set-partitioning formulation. Additionally, a rolling-horizon approach is proposed to address large-scale instances. Extensive numerical experiments are conducted to verify the efficiency of our model and solution approach, as well as the significance of the joint optimization of parcel allocation and the delivery route of the crowdsourced last-mile delivery. The results show that our data-driven column generation algorithm can obtain (near-)optimal solutions for up to 200 parcels in significantly less time than the exact algorithm. For larger instances, the combination of the data-driven column generation algorithm and the rolling-horizon approach can obtain good-quality solutions for up to 1000 parcels in 15 min. Moreover, compared with crowd-courier route optimization only, the joint optimization of parcel allocation and crowd-routing reduces the total cost by 32%.
AB - Urban last-mile delivery providers are facing more and more challenges with the explosive development of e-commerce. The advancement of smart mobile and communication technology in recent years has stimulated the development of a new business model of city logistics, referred to as crowdsourced delivery or crowd-shipping. In this paper, we investigate a form of crowdsourced last-mile delivery that utilizes the journeys of commuters/travelers (crowd-couriers) to deliver parcels from intermediate stations to customers. We consider a logistics service provider that jointly optimizes parcel allocation to intermediate stations and the delivery routing of the crowd-couriers. The joint optimization model gives rise to a new variant of the last-mile delivery problem. We propose a data-driven column generation algorithm to solve the problem based on a set-partitioning formulation. Additionally, a rolling-horizon approach is proposed to address large-scale instances. Extensive numerical experiments are conducted to verify the efficiency of our model and solution approach, as well as the significance of the joint optimization of parcel allocation and the delivery route of the crowdsourced last-mile delivery. The results show that our data-driven column generation algorithm can obtain (near-)optimal solutions for up to 200 parcels in significantly less time than the exact algorithm. For larger instances, the combination of the data-driven column generation algorithm and the rolling-horizon approach can obtain good-quality solutions for up to 1000 parcels in 15 min. Moreover, compared with crowd-courier route optimization only, the joint optimization of parcel allocation and crowd-routing reduces the total cost by 32%.
KW - Crowdsourced delivery
KW - Data-driven column generation
KW - Last-mile delivery
KW - Parcel allocation and crowd routing
UR - http://www.scopus.com/inward/record.url?scp=85151048408&partnerID=8YFLogxK
U2 - 10.1016/j.trb.2023.03.007
DO - 10.1016/j.trb.2023.03.007
M3 - Journal article
AN - SCOPUS:85151048408
SN - 0191-2615
VL - 171
SP - 111
EP - 135
JO - Transportation Research Part B: Methodological
JF - Transportation Research Part B: Methodological
ER -