Vehicle routing with roaming delivery locations

被引:99
作者
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
相关论文
共 26 条