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 条
  • [1] Revenue management opportunities for Internet retailers
    Agatz N.
    Campbell A.M.
    Fleischmann M.
    Van Nunen J.
    Savelsbergh M.
    [J]. Journal of Revenue and Pricing Management, 2013, 12 (2) : 128 - 138
  • [2] Archetti C, 2014, MOS-SIAM SER OPTIMIZ, P273
  • [3] The Vehicle Routing Problem with Occasional Drivers
    Archetti, Claudia
    Savelsbergh, Martin
    Speranza, M. Grazia
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 254 (02) : 472 - 480
  • [4] Simulation of B2C e-commerce distribution in Antwerp using cargo bikes and delivery points
    Arnold, F.
    Cardenas, I.
    Sorensen, K.
    Dewulf, W.
    [J]. EUROPEAN TRANSPORT RESEARCH REVIEW, 2018, 10 (01)
  • [5] Efficiently solving very large-scale routing problems
    Arnold, Florian
    Gendreau, Michel
    Sorensen, Kenneth
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 107 : 32 - 42
  • [6] An adaptive large neighborhood search for a vehicle routing problem with multiple routes
    Azi, Nabila
    Gendreau, Michel
    Potvin, Jean-Yves
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 167 - 173
  • [7] A dynamic vehicle routing problem with multiple delivery routes
    Azi, Nabila
    Gendreau, Michel
    Potvin, Jean-Yves
    [J]. ANNALS OF OPERATIONS RESEARCH, 2012, 199 (01) : 103 - 112
  • [8] An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
    Azi, Nabila
    Gendreau, Michel
    Potvin, Jean-Yves
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (03) : 756 - 763
  • [9] Some applications of the generalized vehicle routing problem
    Baldacci, R.
    Bartolini, E.
    Laporte, G.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2010, 61 (07) : 1072 - 1077
  • [10] The Vehicle Routing Problem with Transhipment Facilities
    Baldacci, Roberto
    Ngueveu, Sandra Ulrich
    Calvo, Roberto Wolfler
    [J]. TRANSPORTATION SCIENCE, 2017, 51 (02) : 592 - 606