The Driver-Aide Problem: Coordinated Logistics for Last-Mile Delivery

被引:4
|
作者
Raghavan, S. [1 ,2 ]
Zhang, Rui [3 ]
机构
[1] Univ Maryland, Robert H Smith Sch Business, College Pk, MD 20742 USA
[2] Univ Maryland, Inst Syst Res, College Pk, MD 20742 USA
[3] Univ Colorado, Leeds Sch Business, Boulder, CO 80309 USA
关键词
branch-cut-and-price; last-mile delivery; driver aide; logistics; service delivery; VEHICLE-ROUTING PROBLEM; CUT ALGORITHMS; PRICE;
D O I
10.1287/msom.2022.0211
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Problem definition: Last-mile delivery is a critical component of logistics networks, accounting for approximately 30%-35% of costs. As delivery volumes have increased, truck route times have become unsustainably long. To address this issue, many logistics companies, including FedEx and UPS, have resorted to using a "driver aide" to assist with deliveries. The aide can assist the driver in two ways. As a "jumper," the aide works with the driver in preparing and delivering packages, thus reducing the service time at a given stop. As a "helper," the aide can independently work at a location delivering packages, and the driver can leave to deliver packages at other locations and then return. Given a set of delivery locations, travel times, service times, jumper's savings, and helper's service times, the goal is to determine both the delivery route and the most effective way to use the aide (e.g., sometimes as a jumper and sometimes as a helper) to minimize the total routing time. Methodology/results: We model this problem as an integer program with an exponential number of variables and an exponential number of constraints and propose a branch-cut-and-price approach for solving it. Our computational experiments are based on simulated instances built on real-world data provided by an industrial partner and a data set released by Amazon. The instances based on the Amazon data set show that this novel operation can lead to, on average, a 35.8% reduction in routing time and 22.0% in cost savings. More importantly, our results characterize the conditions under which this novel operation mode can lead to significant savings in terms of both the routing time and cost. Managerial implications: Our computational results show that the driver aide with both jumper and helper modes is most effective when there are denser service regions and when the truck's speed is higher (>= 10 miles per hour). Coupled with an economic analysis, we come up with rules of thumb (that have close to 100% accuracy) to predict whether to use the aide and in which mode. Empirically, we find that the service delivery routes with greater than 50% of the time devoted to delivery (as opposed to driving) are the ones that provide the greatest benefit. These routes are characterized by a high density of delivery locations.
引用
收藏
页码:291 / 311
页数:22
相关论文
共 50 条
  • [1] A Generalized Bin Packing Problem for parcel delivery in last-mile logistics
    Baidi, Mauro Maria
    Manerba, Daniele
    Perboli, Guido
    Tadei, Roberto
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (03) : 990 - 999
  • [2] Last-Mile Delivery for Consumer Driven Logistics
    Galkin, Andrii
    Obolentseva, Larysa
    Balandina, Iryna
    Kush, Euvgen
    Karpenko, Volodymyr
    Bajdor, Paula
    3RD INTERNATIONAL CONFERENCE GREEN CITIES - GREEN LOGISTICS FOR GREENER CITIES, 2019, 39 : 74 - 83
  • [3] A heuristic algorithm for fourty logistics network design problem with last-mile delivery
    Dong, Li-Wei
    Huang, Min
    Kuang, Han-Bin
    Wang, Xing-Wei
    Kongzhi yu Juece/Control and Decision, 2022, 37 (06): : 1601 - 1608
  • [4] Recent applications for improving the last-mile delivery in urbanism logistics
    Bui, Viet Duc
    Nguyen, Hoang Phuong
    Nguyen, Thi Tuyet Mai
    INTERNATIONAL JOURNAL OF KNOWLEDGE-BASED DEVELOPMENT, 2022, 12 (3-4) : 328 - 346
  • [5] Out-of-home delivery in last-mile logistics: A review
    Janinhoff, Lukas
    Klein, Robert
    Sailer, Daniela
    Schoppa, Jim Morten
    COMPUTERS & OPERATIONS RESEARCH, 2024, 168
  • [6] Collaborative Vehicle Routing Problem for Urban Last-mile Logistics
    Chinh, Nguyen Quoc
    Kim, Heng Chen
    Jiang Siwei
    Zhang NengSheng
    2016 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2016, : 1531 - 1536
  • [7] The last-mile vehicle routing problem with delivery options
    Tilk, Christian
    Olkis, Katharina
    Irnich, Stefan
    OR SPECTRUM, 2021, 43 (04) : 877 - 904
  • [8] The last-mile vehicle routing problem with delivery options
    Christian Tilk
    Katharina Olkis
    Stefan Irnich
    OR Spectrum, 2021, 43 : 877 - 904
  • [9] Modeling and Solving the Time-Dependent in-Building Delivery Problem in Last-Mile Logistics
    Paredes-Belmar, German
    Latorre-Nunez, Guillermo
    Bronfman, Andres
    IEEE ACCESS, 2024, 12 : 11276 - 11293
  • [10] Crowdkeeping in Last-Mile Delivery
    Wang, Xin
    Arslan, Okan
    Delage, Erick
    TRANSPORTATION SCIENCE, 2024, 58 (02) : 474 - 498