摘要:AbstractCross-docking plays an important role in supply chain and can reduce delivery lead times, inventory holding and transportation costs. However, the advantages of cross-docking would be reduced without an efficient vehicle routing. This paper considers a split vehicle routing problem (SVRP) with capacity constraint for multi-product cross-docks. In VRP with split deliveries (pickups) customers (suppliers) are willing to receive (send) goods in multiple shipments and each node can be served by more than one vehicle. The problem is formulated as a mixed-integer linear programming (MILP) model in the GAMS software to determine the best vehicle routes and the optimal number of utilized vehicles.
关键词:Cross-docking;Splitvehicle routing problem;Multi-product;Supply chain;Mixed-integer linear programming