The Value of Preemptive Pick-Up Services in Dynamic Vehicle Routing for Last-Mile Delivery: Space-Time Network-Based Formulation and Solution Algorithms

In recent years, with the increase of emerging pick-up requests during service, logistics companies have been driven to integrate delivery and pick-up service in a dynamic environment. To provide a balanced and robust approach to cope with delivery requests and emerging pick-up requests, this article aims at considering and modeling a practically useful service principle as preemptive services. To our knowledge, most existing studies assume that the dynamically arriving requests are handled in a non-preemptive processing sequence; that is, once the delivery person is allocated to a task, the process is noninterruptible till it gets completed. In the preemptive service, a service suspension of the delivery process (with low service utility) is allowed to satisfy the pick-up requests (with high service utility) first. To provide a systematic assessment on the value of preemptive service for evolving urban logistics systems, a dynamic vehicle routing problem with preemptive pick-up service (VRPPS) is proposed to systematically describe the problem with potentially complex dynamic priorities among different tasks. Based on a dynamically constructed space-time network, this study formulates a multicommodity flow model that aims at optimizing the generalized service utility and the operating cost simultaneously. To provide a fast value approximation, we present a solution framework deploying the augmented Lagrangian relaxation approach with embedded dynamic programming algorithms. This framework jointly integrates the processes of updating request information and obtaining optimal routes. Finally, the validity and effectiveness of the proposed methods are evaluated on an illustrative network and a real-world last-mile delivery network operated by a logistics company.