A routing and scheduling problem for cross-docking networks with perishable products, heterogeneous vehicles and split delivery

Cross-docking is an effective logistics strategy that has long been employed in supply chains with perishable products, where short processing time of goods is required. In this paper, a new multi-objective mixed-integer programming (MIP) model is proposed for scheduling and routing of heterogeneous vehicles carrying perishable goods across multiple cross-docking systems. Inspired by the actual business operations of a large supermarket chain, multiple cross-docks with simultaneous split pick-up and delivery tasks are considered, each of which processing either general or perishable products. In addition, all pick-up/delivery (P/D) requests for perishable products have a deadline that must be met. The main objectives of the developed model are to reduce distribution costs, accelerate distribution processing time, and maximize the cross-docking network's capacity utilization rate. To overcome the complexity of the formulated problem, a novel hybrid solution method, namely AUGMECON2-VIKOR is developed and used in the case-study. The results reveal that AUGMECON2-VIKOR outperforms AUGMECON2, particularly when a larger number of grid points are considered in the proposed solution algorithm.

Automated summary

The paper introduces a new multi-objective mixed-integer programming (MIP) model for efficient scheduling and routing of perishable goods in cross-docking systems. By considering actual business operations and setting deadlines, the model aims to reduce distribution costs, accelerate processing time, and maximize network capacity utilization.