Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers

被引:43
作者
Voigt, Stefan [1 ]
Kuhn, Heinrich [1 ]
机构
[1] Catholic Univ Eichstatt Ingolstadt, Dept Supply Chain Management & Operat, Schanz 49, D-85049 Ingolstadt, Germany
关键词
adaptive large neighborhood search; city logistics; crowdshipping; last‐ mile delivery; mixed‐ integer programming; LAST-MILE DELIVERY; DESIGN; MODEL;
D O I
10.1002/net.22045
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This article considers a setting in which a courier, express, and parcel service provider operates a fleet of vehicles with regular drivers (RDs) to ship parcels from pickup to delivery points. Additionally, the company uses a platform where occasional drivers (ODs) offer their willingness to take on requests that are on or near the route they had originally planned. There exist transshipment points (TPs) to better integrate these ODs. ODs or RDs may transfer load at these predetermined TPs. The problem is modeled as a mixed-integer programming model and called pickup and delivery problem with transshipments and occasional drivers (PDPTOD). We develop a solution approach based on an adaptive large neighborhood search. The article provides insights on how the number and location of TPs impact the cost advantages achieved by integrating ODs. It also shows that the cost savings are highly sensitive to the assumed flexibility and compensation scheme.
引用
收藏
页码:403 / 426
页数:24
相关论文
共 50 条
[21]   The Multistage Stochastic Vehicle Routing Problem with Dynamic Occasional Drivers [J].
Skalnes, Jorgen ;
Dahle, Lars ;
Andersson, Henrik ;
Christiansen, Marielle ;
Hvattum, Lars Magnus .
COMPUTATIONAL LOGISTICS, ICCL 2020, 2020, 12433 :261-276
[22]   Heuristics for routes generation in pickup and delivery problem [J].
Pelikan, Jan ;
Fabry, Jan .
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2012, 20 (03) :463-472
[23]   The Cost of Continuity in the Collaborative Pickup and Delivery Problem [J].
Gansterer, Margaretha ;
Hartl, Richard F. ;
Wieser, Sarah .
COMPUTATIONAL LOGISTICS (ICCL 2018), 2018, 11184 :239-252
[24]   Skip pickup and delivery problem with vehicles circulation [J].
Pelikan, Jan .
PROCEEDINGS OF 30TH INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS, PTS I AND II, 2012, :681-685
[25]   PICKUP AND DELIVERY PROBLEM WITH SPLIT DEMAND AND TRANSFERS [J].
Pelikan, Jan .
KYBERNETIKA, 2013, 49 (05) :755-764
[26]   Heuristics for routes generation in pickup and delivery problem [J].
Jan Pelikán ;
Jan Fábry .
Central European Journal of Operations Research, 2012, 20 :463-472
[27]   The Pickup and Delivery Problem with Crossdock for Perishable Goods [J].
Gkiotsalitis, Konstantinos ;
Nikolopoulou, Amalia .
2023 IEEE 26TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS, ITSC, 2023, :5113-5119
[28]   The two-region multi-depot pickup and delivery problem [J].
Soriano, Adria ;
Gansterer, Margaretha ;
Hartl, Richard F. .
OR SPECTRUM, 2018, 40 (04) :1077-1108
[29]   Approximate dynamic programming for pickup and delivery problem with crowd-shipping [J].
Mousavi, Kianoush ;
Bodur, Merve ;
Cevik, Mucahit ;
Roorda, Matthew J. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2024, 187
[30]   A cooperative vehicle routing problem with delivery options for simultaneous pickup and delivery services in rural areas [J].
Zhang, Ruijuan ;
Dai, Ying ;
Yang, Fei ;
Ma, Zujun .
SOCIO-ECONOMIC PLANNING SCIENCES, 2024, 93