Vehicle routing with roaming delivery locations |
| |
| Affiliation: | 1. College of Management, Chongqing University of Technology, Chongqing 400054, China;2. DEI, University of Bologna, Cesena, Italy;3. College of Mechanical Engineering, Chongqing University, Chongqing, China;1. Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, Via Amendola 2, Reggio Emilia, 42122, Italy;2. HEC Montréal and CIRRELT, 3000 chemin de la Côte-Sainte-Catherine, Montréal, H3T 2A7, Canada;1. Management Science Group, Otto von Guericke University, Magdeburg, Germany;2. Department of Management Sciences, University of Iowa, Iowa City, United States |
| |
| Abstract: | 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. |
| |
| Keywords: | Vehicle routing City logistics Last-mile delivery Car-trunk delivery Heuristics Dynamic programming |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
