This paper studies a collaborative robust supply chain network design (CRSCND) problem aimed at maximizing economic and social benefits by enabling enterprises to jointly address demand uncertainties. Through strategies including joint inventory replenishment, shared distribution centers (DCs), and pooled transportation resources, the CRSCND problem seeks to optimize plant and DC locations and the allocation of DCs to customers under a collaborative framework. To address this, we develop two robust optimization models incorporating a budget uncertainty set, each model representing a distinct risk-pooling policy. These models are then reformulated into solvable linear programming structures. Results from numerical experiments confirm the cost-reduction benefits of collaboration and robust optimization. Sensitivity analysis reveals that factors like violated probability and high demand volatility minimally impact cost savings enabled by collaboration and robustness. Moreover, each robust model shows distinct suitability depending on specific scenario parameters. Finally, we test three cost-saving allocation mechanisms, finding that only the Shapley value method yields best allocations in cases involving overlapping demand.
Read full abstract