Optimal routing and scheduling for a mobile parcel locker delivery system

Abstract

Mobile Parcel Lockers (MPLs), a type of electric vehicle, are gaining popularity in the logistics industry. The primary aim of this study is to address the challenge of optimizing the daily pickup and delivery routes and schedules for MPLs within the framework of a novel business model. In order to achieve this goal, a network flow model has been developed, which aims to minimize operational costs while taking into account the essential constraints related to the movement of MPLs. Additionally, we have presented a series of Relax-and-Fix heuristics and a flow decomposition algorithm to effectively address the formulated model. Through an evaluation using real-world data from a logistics company as an example, the practicality of the model has been verified. In all cases, the gap in objective values between heuristic and CPLEX is very small, averaging at 0.55 %, yet the solution time is reduced by 90.2 %. Meanwhile, sensitivity analysis reveals that routing and scheduling are primarily influenced by factors such as payload restrictions and parcel pickup and delivery locations. The results of our study demonstrate the effectiveness of the model and solution algorithms, thereby offering logistics companies valuable tools for optimizing their MPL delivery routes and schedules with the new business model.