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
相关论文
共 44 条
  • [1] Understanding the impact of e-commerce on last-mile light goods vehicle activity in urban areas: The case of London
    Allen, J.
    Piecyk, M.
    Piotrowska, M.
    McLeod, F.
    Cherrett, T.
    Ghali, K.
    Nguyen, T.
    Bektas, T.
    Bates, O.
    Friday, A.
    Wise, S.
    Austwick, M.
    [J]. TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2018, 61 : 325 - 338
  • [2] Amazon, 2022, Amazon prime air
  • [3] [Anonymous], 2022, CBSNEWS
  • [4] Branch-and-price: Column generation for solving huge integer programs
    Barnhart, C
    Johnson, EL
    Nemhauser, GL
    Savelsbergh, MWP
    Vance, PH
    [J]. OPERATIONS RESEARCH, 1998, 46 (03) : 316 - 329
  • [5] Optimization for drone and drone-truck combined operations: A review of the state of the art and future directions
    Chung, Sung Hoon
    Sah, Bhawesh
    Lee, Jinkun
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 123
  • [6] Vehicle routing with transportable resources: Using carpooling and walking for on-site services
    Coindreau, Marc-Antoine
    Gallay, Olivier
    Zufferey, Nicolas
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 279 (03) : 996 - 1010
  • [7] Cook W, 2021, JUST PASSING
  • [8] Constrained Local Search for Last-Mile Routing
    Cook, William
    Held, Stephan
    Helsgaun, Keld
    [J]. TRANSPORTATION SCIENCE, 2024, 58 (01) : 12 - 26
  • [9] Exact Branch-Price-and-Cut Algorithms for Vehicle Routing
    Costa, Luciano
    Contardo, Claudio
    Desaulniers, Guy
    [J]. TRANSPORTATION SCIENCE, 2019, 53 (04) : 946 - 985
  • [10] Desaulniers G, 2006, COLUMN GENERATION, V5