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 条
[41]   The pickup and delivery problem with alternative locations and overlapping time windows [J].
Dragomir, Alina G. ;
Van Woensel, Tom ;
Doerner, Karl F. .
COMPUTERS & OPERATIONS RESEARCH, 2022, 143
[42]   The drone-assisted pickup and delivery problem: An adaptive large neighborhood search metaheuristic [J].
Mulumba, Timothy ;
Najy, Waleed ;
Diabat, Ali .
COMPUTERS & OPERATIONS RESEARCH, 2024, 161
[43]   Multi-Depot Pickup and Delivery Problem with Resource Sharing [J].
Wang, Yong ;
Ran, Lingyu ;
Guan, Xiangyang ;
Zou, Yajie .
JOURNAL OF ADVANCED TRANSPORTATION, 2021, 2021
[44]   A pickup and delivery problem using crossdocks and truckload lane rates [J].
Lindsey, Kathleen A. ;
Erera, Alan L. ;
Savelsbergh, Martin W. P. .
EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2013, 2 (1-2) :5-27
[45]   An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers [J].
Masson, Renaud ;
Lehuede, Fabien ;
Peton, Olivier .
TRANSPORTATION SCIENCE, 2013, 47 (03) :344-355
[46]   Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem [J].
Cortes, Cristian E. ;
Saez, Doris ;
Nunez, Alfredo ;
Munoz-Carpintero, Diego .
TRANSPORTATION SCIENCE, 2009, 43 (01) :27-42
[47]   The capacitated pollution routing problem with pickup and delivery in the last mile [J].
Tan, Yuyang ;
Deng, Lei ;
Li, Longxiao ;
Yuan, Fang .
ASIA PACIFIC JOURNAL OF MARKETING AND LOGISTICS, 2019, 31 (04) :1193-1215
[48]   A cumulative service state representation for the pickup and delivery problem with transfers [J].
Mahmoudi, Monirehalsadat ;
Chen, Junhua ;
Shi, Tie ;
Zhang, Yongxiang ;
Zhou, Xuesong .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2019, 129 :351-380
[49]   An Auction-Based Multiagent Simulation for the Matching Problem in Dynamic Vehicle Routing Problem with Occasional Drivers [J].
Shen, Chung-Wei ;
Hsu, Che-Cheng ;
Tseng, Kuan-Hua .
JOURNAL OF ADVANCED TRANSPORTATION, 2022, 2022
[50]   The Restaurant Meal Delivery Problem: Dynamic Pickup and Delivery with Deadlines and Random Ready Times [J].
Ulmer, Marlin W. ;
Thomas, Barrett W. ;
Campbell, Ann Melissa ;
Woyak, Nicholas .
TRANSPORTATION SCIENCE, 2021, 55 (01) :75-100