Vehicle routing with roaming delivery locations

被引:88
|
作者
Reyes, Damian [1 ]
Savelsbergh, Martin [1 ]
Toriello, Alejandro [1 ]
机构
[1] Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30318 USA
关键词
Vehicle routing; City logistics; Last-mile delivery; Car-trunk delivery; Heuristics; Dynamic programming; SCHEDULING PROBLEMS; TIME WINDOWS; ALGORITHMS;
D O I
10.1016/j.trc.2017.04.003
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
We propose the vehicle routing problem with roaming delivery locations (VRPRDL) to model an innovation in last-mile delivery where a customer's order is delivered to the trunk of his car. We develop construction and improvement heuristics for the VRPRDL based on two problem-specific techniques: (1) efficiently optimizing the delivery locations for a fixed customer delivery sequence and (2) efficiently switching a predecessor's or successor's delivery location during the insertion or deletion of a customer in a route. Furthermore, we conduct an extensive computation study to assess and quantify the benefits of trunk delivery in a variety of settings. The study reveals that a significant reduction in total distance travelled can be achieved, especially when trunk delivery is combined with traditional home delivery, which has both economic and environmental benefits. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:71 / 91
页数:21
相关论文
共 50 条
  • [1] A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations
    Ozbaygin, Gizem
    Karasan, Oya Ekin
    Savelsbergh, Martin
    Yaman, Hande
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2017, 100 : 115 - 137
  • [2] An iterative re-optimization framework for the dynamic vehicle routing problem with roaming delivery locations
    Ozbaygin, Gizem
    Savelsbergh, Martin
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2019, 128 : 207 - 235
  • [3] Vehicle routing with private and shared delivery locations
    Mancini, Simona
    Gansterer, Margaretha
    COMPUTERS & OPERATIONS RESEARCH, 2021, 133
  • [4] The vehicle routing problem with time windows and flexible delivery locations
    Frey, Christian M. M.
    Jungwirth, Alexander
    Frey, Markus
    Kolisch, Rainer
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (03) : 1142 - 1159
  • [5] Multi-depot vehicle routing problem with roaming delivery locations considering hard time windows: Solved by a hybrid ELS-LNS algorithm
    Jolfaei, Ali Aghadavoudi
    Alinaghian, Mahdi
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 255
  • [6] An effective metaheuristic for the last mile delivery with roaming delivery locations and stochastic travel times
    He, Yandong
    Qi, Mingyao
    Zhou, Fuli
    Su, Jiafu
    COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 145
  • [7] Locations and vehicle routing designs of physical distribution systems
    Su, Chwen-Tzeng
    Production Planning and Control, 1998, 9 (07): : 650 - 659
  • [8] Locations and vehicle routing designs of physical distribution systems
    Su, CT
    PRODUCTION PLANNING & CONTROL, 1998, 9 (07) : 650 - 659
  • [9] Optimal Routing for Split Delivery Vehicle Routing Problems
    Chen, Ruey-Maw
    Guo, Jia-Ci
    2018 7TH INTERNATIONAL CONGRESS ON ADVANCED APPLIED INFORMATICS (IIAI-AAI 2018), 2018, : 667 - 670
  • [10] SPLIT DELIVERY VEHICLE ROUTING PROBLEM
    Pelikan, Jan
    Fabry, Jan
    MATHEMATICAL METHODS IN ECONOMICS 2009, 2009, : 259 - 262