A Greedy Tabu Dual Heuristic algorithm for the cyclic pickup and delivery problem with 3D loading constraints

The optimization of auto parts supply chain logistics plays a decisive role in the development of the automotive industry. To reduce logistics costs and improve transportation efficiency, this paper addresses the joint optimization problem of multi-vehicle pickup and delivery transportation paths under time window constraints, coupled with the three-dimensional loading of goods. The model considers mixed time windows, three-dimensional loading constraints, cyclic pickup and delivery paths, varying vehicle loads and volumes, flow balance, and time window constraints. Evaluation rules for the three-dimensional loading test of goods are also set, resulting in constructing a comprehensive optimization model for the inbound logistics of auto parts and components. In this study, a Greedy-Tabu Dual-Heuristic algorithm is proposed, which integrates an Improved Greedy Algorithm with an Enhanced Tabu Search Algorithm based on the \(\varepsilon\) -sampling strategy. The overall problem-solving process for the Improved Greedy Algorithm and the Tabu Search Algorithm is outlined. The superiority, efficiency, and stability of the improved algorithm are verified by solving cases of various sizes and analyzing the algorithm’s results before and after improvement. A case study involving the third-party logistics company R Enterprise compares the pickup and delivery-separated Milk-Run mode with the simultaneous delivery and pickup Milk-Run mode. The proposed method shows a 26.67% reduction in total distance traveled and a 46.60% decrease in waiting time compared to the traditional Milk-Run approach. Additionally, when evaluated against the standard 3D loading inspection method, the proposed approach improves average vehicle load utilization by 17% and vehicle volume utilization by 15%. These findings verify the applicability and superiority of the proposed algorithms and models in practical scenarios.