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

被引:37
|
作者
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 条
  • [1] The pickup and delivery problem with time windows and occasional drivers
    Dahle, Lars
    Andersson, Henrik
    Christiansen, Marielle
    Speranza, M. Grazia
    COMPUTERS & OPERATIONS RESEARCH, 2019, 109 : 122 - 133
  • [2] The vehicle routing problem with simultaneous pickup and delivery and occasional drivers
    Yu, Vincent F.
    Aloina, Grace
    Jodiawan, Panca
    Gunawan, Aldy
    Huang, Tsung-Chi
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 214
  • [3] The pickup and delivery problem with multiple depots and dynamic occasional drivers in crowdshipping delivery
    Tao, Yi
    Zhuo, Haibing
    Lai, Xiaofan
    COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 182
  • [4] Crowdsourced Delivery-A Dynamic Pickup and Delivery Problem with Ad Hoc drivers
    Arslan, Alp M.
    Agatz, Niels
    Kroon, Leo
    Zuidwijk, Rob
    TRANSPORTATION SCIENCE, 2019, 53 (01) : 222 - 235
  • [5] Dynamic pickup and delivery problem with transshipments and LIFO constraints
    Xu, Xiaofeng
    Wei, Zhifei
    COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 175
  • [6] Pickup and delivery planning for the crowdsourced freight delivery routing problem
    Zhang, Jingxian
    PLOS ONE, 2025, 20 (02):
  • [7] An exact algorithm for the pickup and delivery problem with crowdsourced bids and transshipment
    Su, E.
    Qin, Hu
    Li, Jiliu
    Pan, Kai
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2023, 177
  • [8] The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach
    Wolfinger, David
    Salazar-Gonzalez, Juan-Jose
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (02) : 470 - 484
  • [9] The pickup and delivery problem with transshipments: Critical review of two existing models and a new formulation
    Lyu, Zefeng
    Yu, Andrew Junfang
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 305 (01) : 260 - 270
  • [10] A Large Neighborhood Search for the Pickup and Delivery Problem with Time Windows, Split Loads and Transshipments
    Wolfinger, David
    COMPUTERS & OPERATIONS RESEARCH, 2021, 126