The rapid development of the urban logistics recycling industry, combined with the complexity of the pickup and delivery networks, has created a surge in dynamic customer demands and exacerbated the difficulty of logistics resource sharing. Accordingly, this work focuses on a multi-depot pickup and delivery vehicle routing problem with time windows and dynamic demands, which incorporates resource sharing. A bi-objective mathematical model is formulated to minimize the total operating cost and number of vehicles. A three-dimensional affinity propagation clustering and an adaptive nondominated sorting genetic algorithm-II are combined to find Pareto optimal solutions. A dynamic demand insertion strategy is proposed to determine the vehicle service sequences for dynamic situations. Combined with an elite iteration mechanism to prevent the proposed algorithm from falling into search stagnation and improve the convergence performance. The superiority of the proposed algorithm is verified by comparing with CPLEX solver (i.e., ILOG CPLEX Optimization Studio 12.10), multi-objective ant colony optimization, multi-objective particle swarm optimization, multi-objective evolutionary algorithm, multi-objective genetic algorithm, and decomposition-based multi-objective evolutionary algorithm with tabu search. Besides, the proposed model and algorithm are tested by a real-world case study in Chongqing city, China, and the further analysis indicates that significant improvement can be achieved. Furthermore, by incorporating the recognition and prediction techniques of artificial intelligence on dynamic demand data, the proposed approach can realize the self-optimization of multi-depot vehicle routes and the precise allocation of logistics resources in dynamic environments. This study is conducive to the construction of a digitally-intelligent urban logistics system.
Read full abstract