Crowdshipping by employees of distribution centers: Optimization approaches for matching supply and demand

被引:47
作者
Boysen, Nils [1 ]
Emde, Simon [2 ]
Schwerdfeger, Stefan [3 ]
机构
[1] Friedrich Schiller Univ Jena, Lehrstuhl Operat Management, Carl Zeiss Str 3, D-07743 Jena, Germany
[2] Aarhus Univ, Dept Econ & Business Econ, CORAL, Fuglesangs Alle 4, DK-8210 Aarhus V, Denmark
[3] Friedrich Schiller Univ Jena, Lehrstuhl Operat Management & Lehrstuhl Managemen, Carl Zeiss Str 3, D-07743 Jena, Germany
关键词
Transportation; Last-mile deliveries; Crowdshipping; Benders decomposition; LAST-MILE DELIVERY; ORIENTEERING PROBLEM; MODEL; CLASSIFICATION; LOGISTICS; ALGORITHM; SYSTEM;
D O I
10.1016/j.ejor.2021.04.002
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Seeing the huge success of sharing platforms such as Uber, Lyft, and Airbnb, where owners of under-used assets are connected with users willing to pay for the use of these assets, it is not surprising that retailers aim to transfer the basic idea of the sharing economy to their last-mile deliveries. In crowdshipping, the under-used assets are transport capacities of private drivers and the users are the retailers aiming for additional and cost-efficient delivery capacities for their home deliveries. A major drawback of crowd shipping is that retailers can hardly guarantee their promised delivery services when subcontracting individuals. To avoid this problem, different retailers are establishing crowdshipping platforms offering a reward to the employees of their distribution centers for crowdshipping online orders on their way back from work. We investigate the resulting optimization problem for matching crowdshipping supply and demand in this context. We present an efficient exact solution procedure based on Benders decomposition, which maximizes the number of matched shipments while considering the employees' minimum expected earnings per time unit. This procedure is shown to solve instances of real-world size before a work shift is over and the shipments have to be loaded into the trunks of the employees' cars. Furthermore, we show the impact of crowdshipping on all main stakeholders and identify critical success factors. (c) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码:539 / 556
页数:18
相关论文
共 60 条
[1]   Optimization for dynamic ride-sharing: A review [J].
Agatz, Niels ;
Erera, Alan ;
Savelsbergh, Martin ;
Wang, Xing .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 223 (02) :295-303
[2]   Building a collaborative solution in dense urban city settings to enhance parcel delivery: An effective crowd model in Paris [J].
Akeb, Hakim ;
Moncef, Btissam ;
Durand, Bruno .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2018, 119 :223-233
[3]   A dynamic crowdshipping model and daily travel behavior [J].
Allahviranloo, Mandieh ;
Baghestani, Amirhossein .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2019, 128 :175-190
[4]   Crowdsourced delivery: A review of platforms and academic literature [J].
Alnaggar, Aliaa ;
Gzara, Fatma ;
Bookbinder, James H. .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 98
[5]  
[Anonymous], 2011, 10 IDEAS WILL CHANGE
[6]  
[Anonymous], 1956, P AM MATH SOC, DOI [10.1090/S0002-9939-1956-0078686-7, DOI 10.1090/S0002-9939-1956-0078686-7]
[7]  
Applegate D., 2006, The Traveling Salesman Problem: A Computational Study
[8]   The Vehicle Routing Problem with Occasional Drivers [J].
Archetti, Claudia ;
Savelsbergh, Martin ;
Speranza, M. Grazia .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 254 (02) :472-480
[9]   Crowdsourced Delivery-A Dynamic Pickup and Delivery Problem with Ad Hoc drivers [J].
Arslan, Alp M. ;
Agatz, Niels ;
Kroon, Leo ;
Zuidwijk, Rob .
TRANSPORTATION SCIENCE, 2019, 53 (01) :222-235
[10]  
Bakach I., 2020, Working Paper Series