Multitrip vehicle routing with delivery options: a data-driven application to the parcel industry

被引:9
作者
Janinhoff, Lukas [1 ]
Klein, Robert [1 ]
Scholz, Daniel [2 ]
机构
[1] Univ Augsburg, Chair Analyt & Optimizat, Universitatsstr 16, D-86159 Augsburg, Germany
[2] Gen Logist Syst Germany GmbH & Co OHG, Kolner Str 3, D-65760 Eschborn, Germany
关键词
Data-driven decision making; Last-mile delivery; Fulfillment options; Vehicle routing; Adaptive large neighborhood search; Demand management; LARGE NEIGHBORHOOD SEARCH; E-COMMERCE; FINAL DELIVERIES; ALGORITHM; PICKUP; SERVICES; CUSTOMER; URBAN; MANAGEMENT; IMPACT;
D O I
10.1007/s00291-023-00710-6
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
To make the last mile of parcel delivery more efficient, service providers offer an increasing number of modes of delivery as alternatives to the traditional and often cost-intensive home delivery service. Parcel lockers and pickup stations can be utilized to reduce the number of stops and avoid costly detours. To design smart delivery networks, service providers must evaluate different business models. In this context, a multitrip vehicle routing problem with delivery options and location-dependent costs arises. We present a data-driven framework to evaluate alternative delivery strategies, formulate a corresponding model and solve the problem heuristically using adaptive large neighborhood search. By examining large, real-life instances from a major European parcel service, we determine the potential and benefits of different delivery options. Specifically, we show that delivery costs can be mitigated by consolidating orders in pickup stations and illustrate how pricing can be applied to steer customer demand toward profitable, eco-friendly products.
引用
收藏
页码:241 / 294
页数:54
相关论文
共 76 条
  • [51] A powerful route minimization heuristic for the vehicle routing problem with time windows
    Nagata, Yuichi
    Braysy, Olli
    [J]. OPERATIONS RESEARCH LETTERS, 2009, 37 (05) : 333 - 338
  • [52] Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis
    Orenstein, Ido
    Raviv, Tal
    Sadan, Elad
    [J]. EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2019, 8 (05) : 683 - 711
  • [53] A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations
    Ozbaygin, Gizem
    Karasan, Oya Ekin
    Savelsbergh, Martin
    Yaman, Hande
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2017, 100 : 115 - 137
  • [54] Pisinger D, 2010, INT SER OPER RES MAN, V146, P399, DOI 10.1007/978-1-4419-1665-5_13
  • [55] A PARALLEL ROUTE BUILDING ALGORITHM FOR THE VEHICLE-ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS
    POTVIN, JY
    ROUSSEAU, JM
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 66 (03) : 331 - 340
  • [56] POTVIN JY, 1995, J OPER RES SOC, V46, P1433, DOI 10.1038/sj/jors/0461203
  • [57] PricewaterhouseCoopers, 2018, SOL PARC DIL
  • [58] Vehicle routing with roaming delivery locations
    Reyes, Damian
    Savelsbergh, Martin
    Toriello, Alejandro
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2017, 80 : 71 - 91
  • [59] Rohmer S., 2020, A Guide to Parcel Lockers in Last Mile Distribution-Highlighting Challenges and Opportunities from an OR Perspective', April
  • [60] An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
    Ropke, Stefan
    Pisinger, David
    [J]. TRANSPORTATION SCIENCE, 2006, 40 (04) : 455 - 472