Collaboration and Resource Sharing in the Multidepot Multiperiod Vehicle Routing Problem with Pickups and Deliveries

In this work, a multidepot multiperiod vehicle routing problem with pickups and deliveries (MDPVRPPD) is solved by optimizing logistics networks with collaboration and resource sharing among logistics service providers. The optimal solution can satisfy customer demands with periodic time characteristics and incorporate pickup and delivery services with maximum resource utilization. A collaborative mechanism is developed to rearrange both the open and closed vehicle routes among multiple pickup and delivery centers with improved transportation efficiency and reduced operational costs. The effects of resource sharing strategies combining customer information sharing, facility service sharing, and vehicle sharing are investigated across multiple service periods to maximize resource utilization and refine the resource configuration. A multiobjective optimization model is developed to formulate the MDPVRPPD so that the minimum total operational costs, waiting time, and the number of vehicles are obtained. A hybrid heuristic algorithm incorporating a 3D clustering and an improved multiobjective particle swarm optimization (IMOPSO) algorithm is introduced to solve the MDPVRPPD and find Pareto optimal solutions. The proposed hybrid heuristic algorithm is based on a selective exchange mechanism that enhances local and global searching capabilities. Results demonstrate that the proposed IMOPSO outperforms other existing algorithms. We also study profit allocation issues to quantify the stability and sustainability of long-term collaboration among logistics participants, using the minimum costs remaining savings method. The proposed model and solution methods are validated by conducting an empirical study of a real system in Chongqing City, China. This study contributes to the development of efficient urban logistics distribution systems, and facilitates the expansion of intelligent and sustainable supply chains.